Solving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm


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… (More)


2 Figures and Tables

Slides referencing similar topics