Solving the shortest path problem in vehicle navigation system by ant colony algorithm

Authors:
Yong Jiang;Wan-Liang Wang;Yan-Wei Zhao
Affiliations:
Collego of Information Engineering, Zhejiang University of Techonology, Hangzhou, China;Collego of Information Engineering, Zhejiang University of Techonology, Hangzhou, China;Collego of Information Engineering, Zhejiang University of Techonology, Hangzhou, China
Venue:
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Year:
2007

Citing 4
Cited 1

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Graph Theory With Applications

Graph Theory With Applications
A genetic algorithm for the multiple destination routing problems

IEEE Transactions on Evolutionary Computation
A genetic algorithm for shortest path routing problem and the sizing of populations

IEEE Transactions on Evolutionary Computation

Ant colony optimisation for vehicle traffic systems: applications and challenges

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A shortest path search method based on ant colony algorithm is proposed. The method contracts the search space appropriately, obtaining, in a short time, a path that is as close as possible to the path obtained by the Dijkstra method (the optimum path). To improve the performance, we modify the pheromone update rule and introduce a learning strategy into the ant colony algorithm. The method obtains a solution to a problem given within a specified time, such as path search in a vehicle navigation system. The effectiveness of the method is described through use of simulations.