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.