How to provide a route to meet the driver's multiple psychological expectations is the key problem of a navigation system. Essentially, this problem is a resource constrained shortest path problem (RCSP), which belongs to NP hard problems and can not be solved with the traditional shortest path algorithm. A multi-constrained shortest path mathematical model is presented in this paper and solved with an improved ant colony algorithm. The pheromone update rule and heuristic factor are redesigned in the algorithm. Results show that the improved optimization algorithm has a good ability to accurately determine the multi-constrained shortest path in the road network.
Multi-Constrained Shortest Path Model and Solution with Improved Ant Colony Algorithm
Seventh International Conference on Traffic and Transportation Studies (ICTTS) 2010 ; 2010 ; Kunming, China
Traffic and Transportation Studies 2010 ; 501-510
2010-07-26
Conference paper
Electronic Resource
English
Multi-Constrained Shortest Path Model and Solution with Improved Ant Colony Algorithm
British Library Conference Proceedings | 2010
|An improved solution algorithm for the constrained shortest path problem
Online Contents | 2007
|Improved ant colony algorithm for shortest path problem in time-dependent networks
British Library Online Contents | 2009
|An Improved Ant Colony Algorithm for the Shortest Path Problem in Time-Dependent Networks
British Library Conference Proceedings | 2009
|