Abstract—Being able to carry out tasks like moving from one point to another with great speed is highly needed in this 4.0 revolution era. Therefore, information technology is expected to provide a lasting solution to this problem. The aim of this research is to create an android application and website which runs on the Ant Colony Algorithm and is capable of determining the shortest path to a location, such as the mosque, restaurant, and clinic in specific region. Furthermore, it aims to use the architecture system, which consists of several stages, such as data collection, and management, which is carried out through three phases, including, parsing MySQL data to the JSON, then to Java, and lastly, managing the data using the ant algorithm in order to find the shortest pathway. The result was then examined, and it showed that this application is capable of detecting the shortest distance between two locations. Therefore, it will be beneficial to both the locals and tourists in a specific region.
 

Index Terms—Android, ant colony algorithm, shortest path, GIS mobile

Cite: Juhriyansyah Dalle, Dwi Hastuti, and Muhammad Riko Anshori Prasetya, "The Use of an Application Running on the Ant Colony Algorithm in Determining the Nearest Path between Two Points," Journal of Advances in Information Technology, Vol. 12, No. 3, pp. 206-213, August 2021. doi: 10.12720/jait.12.3.206-213

Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.