The use of an application running on the ant colony algorithm in determining the nearest path between two points

25Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Dalle, J., Hastuti, D., & Prasetya, M. R. A. (2021). 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, 12(3), 206–213. https://doi.org/10.12720/jait.12.3.206-213

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free