Abstract
The computation of least-cost paths over a cost surface is a well-known and widely used capability of raster geographic information systems (GISs). It consists of finding the path w ith the lowest accumulated cost between two locations in a raster model of a cost surface. This paper presents a modified Artificial Bee Co lony (ABC) algorithm for solving least-cost path problem in a raster-based GIS. This modification includes the incorporation of a disti nct feature which is not present in the classical ABC. A new component, the direction guidance search method, is used to guide a bee walking toward the final destination more efficiently. In additio n, this paper examines how the quality of the raster-based paths can be improved by using larger connectivity patterns. The experimental results show that the performance of the modified ABC model is quite cl ose to Dijkstra's algorithm while its computational comple xity and solution time is much lower than Dijkstra's algorithm. The r esults also, indicate that raster-based paths can be improv ed by using larger connectivity patterns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
