An improved algorithm to solve the problem of optimum route planning in vehicle navigation systems is proposed in this paper. This algorithm is based on the standard genetic algorithm and the λ-interchange local search method and has evolved from the improved A shortest-path algorithm. This algorithm can find the optimum route more efficiently and quickly without any network constraint condition and can work well either in continuous or in discrete networks. Finally the experimental simulation results which verify the feasibility and validity of this algorithm are shown.
Research and realization of optimum route planning in vehicle navigation systems based on a hybrid genetic algorithm
2008-05-01
7 pages
Article (Journal)
Electronic Resource
English
Automotive engineering | 2008
|Fast route planning algorithm for vehicle location and navigation systems
British Library Online Contents | 2002
|British Library Conference Proceedings | 2003
|