Multi-constrained shortest path model and solving
Weiming Liu · Journal of Hunan University of Science & Technology · 2010
How to provide route to meet the driver's multiple psychological expectations is the key problem of navigation system.The essence of this problem is resource constrained shortest path problem (RCSP),which belongs to NP-C problems and can not be solved with the traditional shortest path algorithm.Multi-constrained shortest path mathematical model was presented,and ant colony algorithm was used to solve it.Aimed at the problem,pheromone update rule and heuristic factor were redesigned in the algorithm.Experiments show that the improved optimization algorithm have a good ability to accurately find multi-constrained shortest path in road network.