Design and Analysis of the Ant Colony Algorithm to Find the Shortest Route to Sibolga Disaster Locations

Authors

  • Roy Bule Damanik Universitas Pembangunan Panca Budi
  • Khairul Universitas Pembangunan Panca Budi

Keywords:

Ant Colony Algorithm, Shortest Path, Disaster Location, Route Optimisation, Sibolga

Abstract

Determining the shortest route to the disaster location is one of the important aspects in supporting the speed of emergency response. The accuracy in selecting routes can expedite the evacuation process, aid distribution, and the mobilisation of personnel to the disaster site. The city of Sibolga, as an area with a diverse road network, requires a method capable of determining the optimal route effectively and efficiently. This research aims to design and analyse the Ant Colony Optimisation (ACO) algorithm in determining the shortest route to disaster locations in Sibolga. The research methods used include identifying location points and road networks, graph modelling in the form of nodes and weighted edges, designing the Ant Colony algorithm, and testing the route search results based on travel distance. The ACO algorithm works by mimicking the behaviour of ant colonies in finding the best path through pheromone mechanisms and iterative processes. The research results are expected to show that the Ant Colony algorithm is capable of generating the optimal shortest path from the starting point to the disaster location based on the used road network data. Additionally, the analysis of the algorithm's performance provides an overview of the effectiveness of this method in supporting route determination systems in emergency conditions. This research is expected to contribute to the development of decision support systems for disaster management, particularly in accelerating access to disaster locations in the city of Sibolga.

References

A. A. Journal, I. Simatupang, P. Studi, A. Sosial, and U. S. U. Medan-indonesia, “EKSISTENSI MASYARAKAT PESISIR DI SIBOLGA : STUDI,” vol. 6, no. 2, pp. 96–119, 2022, doi: 10.29103/aaj.v6i2.6866.

S. Firda and L. Akhadah, “Penerapan Algoritma Ant Colony pada Pendistribusian Barang,” vol. 5, no. 1, pp. 57–63, 2025.

B. D. Febrianti et al., “IMPLEMENTASI ALGORITMA ANT COLONY DALAM MENENTUKAN RUTE,” vol. 9, no. 1, pp. 243–249, 2025.

A. Jain, S. Jain, and P. K. Chande, “Formulation of Genetic Algorithm to Generate Good Quality Course Timetable,” vol. 1, no. 3, pp. 248–251, 2010.

R. D. Santosa, D. Jaenudin, and B. Algorit, “Prototype Aplikasi Penjadwalan Manning Agent Crew Kapal Tanker Menggunakan Algoritma Ant Colony Optimization : Study Kasus PT Scorpa Pranedya,” pp. 82–90, 2016.

A. R. Amin, M. Ikhsan, and L. Wibisono, “Traveling Salesman Problem,” pp. 1–6, 1976.

E. K. Burke, D. G. Elliman, and R. Weare, “A University Timetabling System based on Graph Colouring and Constraint Manipulation”.

A. Conference et al., “Asian Conference on Disaster Reduction 2003 Chairperson ’ s Summary Asian Conference on Disaster Reduction 2003 --- Living with Risk : Towards Disaster Resilient Societies --- 1 . Perspective of a New Disaster Reduction Strategy in Asia Asian Conference on Disaster Reduction 2003,” no. January, pp. 15–18, 2003.

M. Hoard, J. Homer, W. Manley, P. Furbee, A. Haque, and J. Helmkamp, “Systems modeling in support of evidence-based disaster planning for rural areas,” vol. 208, pp. 117–125, 2005, doi: 10.1016/j.ijheh.2005.01.011.

F. Chemical and R. Terrorism, DISASTER NURSING AND EMERGENCY.

U. Padjadjaran, E. Kuswarno, U. Padjadjaran, P. Hadisiwi, and U. Padjadjaran, “e-ISSN: 2686-5009 Digital Media Marketing Strategy to Improve Data Dissemination at the Statistics Indonesia,” no. 16, 2014.

J. I. Manajemen, “AT – TADBIR JURNAL ILMIAH MANAJEMEN Homepage: ojs.uniska.ac.id/attadbir”.

E. A. Lisangan and P. Chyan, “Penerapan Ant Colony Optimization Sebagai Problem Solver Dalam Sliding Puzzle Games,” vol. 1, no. 2013, pp. 1–5, 2014.

Downloads

Published

2025-10-27

Most read articles by the same author(s)