Genetic algorithm to find the shortest path on raster data

Sang Pil Kim, Hyong Sig Cho, Seung Hwan Hong, Han Jin Cho, Hong Gyoo Sohn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2014 International Conference on Control, Automation and Information Sciences, ICCAIS 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages144-147
Number of pages4
ISBN (Electronic)9781479972043
DOIs
Publication statusPublished - 2014 Jan 23
Event3rd International Conference on Control, Automation and Information Sciences, ICCAIS 2014 - Gwangju, Korea, Republic of
Duration: 2014 Dec 22014 Dec 5

Publication series

Name2014 International Conference on Control, Automation and Information Sciences, ICCAIS 2014

Other

Other3rd International Conference on Control, Automation and Information Sciences, ICCAIS 2014
Country/TerritoryKorea, Republic of
CityGwangju
Period14/12/214/12/5

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Genetic algorithm to find the shortest path on raster data'. Together they form a unique fingerprint.

Cite this