论文信息 - Genetic algorithm to find the shortest path on raster data

Genetic algorithm to find the shortest path on raster data

Dijkstra's algorithm proposed by Edsger Dijkstra in 1959 is mainly used to find the shortest path. However, Dijkstra's algorithm is not suitable on raster data because it developed based on network data and has high computational complexity. In this study, genetic algorithms are proposed to find the shortest path on raster data. In particular, the 2D array representation and genetic operators adapted to the given problem were proposed. The proposed algorithm was tested on simulation cost raster data. The result shows proposed algorithm stably find the shortest path.

Hong-Gyoo Sohn | Han-Jin Cho | Seunghwan Hong | Sangpil Kim | Hyong Sig Cho

[1] I. Parberry,et al. A Method for Searching Optimal Routes with Collision Avoidance on Raster Charts , 2003, Journal of Navigation.

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3] Adam Lipowski,et al. Roulette-wheel selection via stochastic acceptance , 2011, ArXiv.

[4] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.

[5] Riccardo Poli,et al. Genetic algorithm-based interactive segmentation of 3D medical images , 1999, Image Vis. Comput..

[6] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[7] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[8] Ingoo Han,et al. Genetic algorithms approach to feature discretization in artificial neural networks for the prediction of stock price index , 2000 .

[9] Weng Tat Chan,et al. CONSTRUCTION RESOURCE SCHEDULING WITH GENETIC ALGORITHMS , 1996 .

[10] K. Dejong,et al. An analysis of the behavior of a class of genetic adaptive systems , 1975 .