CONFERENCE PROCEEDINGS
Advanced Search
Home > Proceedings > Volume 12506 > Article
Open Access Paper
28 December 2022 Research on transportation optimal path planning based on improved ant colony algorithm
Jun Nie
Author Affiliations +
Proceedings Volume 12506, Third International Conference on Computer Science and Communication Technology (ICCSCT 2022); 125060T (2022) https://doi.org/10.1117/12.2661791
Event: International Conference on Computer Science and Communication Technology (ICCSCT 2022), 2022, Beijing, China
Abstract
In this paper, an improved ant colony algorithm is proposed to solve the transportation optimal path problem. The algorithm can quickly find the optimal path by improving heuristic function, pheromone and neighbourhood-search. Experimental simulation shows that the improved ant colony algorithm proposed in this paper has certain advantages over genetic algorithm and ant colony algorithm. It not only obtains the minimum value of the optimal path length, but also has the fastest convergence speed, which effectively solves the problem of optimal transportation path planning. The improved algorithm effectively accelerates the transportation speed, shortens the transportation time and saves the transportation cost.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Jun Nie "Research on transportation optimal path planning based on improved ant colony algorithm", Proc. SPIE 12506, Third International Conference on Computer Science and Communication Technology (ICCSCT 2022), 125060T (28 December 2022); https://doi.org/10.1117/12.2661791
PROCEEDINGS
 6 PAGES
DOWNLOAD PAPER SAVE TO MY LIBRARY
GET CITATION
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optimization (mathematics)
Roads
Genetic algorithms
Detection and tracking algorithms
Computer simulations
Mathematical modeling
Scientific research
RELATED CONTENT
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top