Problem for shortest path problem based on heuristic algorithm
Renbiao Wang · Journal of Jilin University · 2011
An adjacency list storage model with heuristic information is proposed. An evaluation function to calculate the weight among nodes was derived. The relative position of the node in the adjacency list was optimized using the evaluation function. The process of initial population with heuristic information and chromosome coding, and the strategy of dynamic adjustment of the fitness function were presented. The main performance parameters were obtained by simulation, and the proposed algorithm was compared with the Dijkstra algorithm. Experiment results show that the proposed algorithm possesses higher efficiency when solving the optimization problem of shortest path with high spatial complexity.