Jurnal
Tanpa peringkat SINTA
Tourism Route Optimization Based on the Travelling Salesman Problem Using Ant Colony Optimization in the Banyumas and Purbalingga Regions
Edu Komputika Journal · Vol. 13 No. 1 (2026) · hlm. 55–64
ISSN 2599-297X, 2252-6811
Terbit 2026-08-31
Penerbit Universitas Negeri Semarang
Bahasa eng
Abstrak
Tourism route planning requires an efficient visiting sequence to reduce travel distance and transportation costs. When multiple tourist destinations must be visited in a single trip, the route-planning problem can be formulated as a Travelling Salesman Problem (TSP). This study implements Ant Colony Optimization (ACO) to determine an efficient route among 12 tourist destinations in Banyumas and Purbalingga. The destinations were represented as nodes in a weighted graph, while the travel distance between each pair of destinations was used as the edge weight. The algorithm constructed candidate routes using probabilistic selection and updated pheromone values based on route quality. Three pheromone evaporation rates, namely ρ=0.3, ρ=0.5, and ρ=0.7, were evaluated. The shortest route obtained in the first iteration was W1–W3–W2–W4–W8–W9–W7–W10–W11–W12–W6–W5–W1, with a total distance of 109.0 km. After pheromone updating, the pheromone levels on the shortest-route edges were 0.016174, 0.014174, and 0.012174 for evaporation rates of 0.3, 0.5, and 0.7, respectively. These results show that the evaporation rate directly affects pheromone retention, with a lower evaporation rate maintaining stronger pheromone information on the selected route. The study demonstrates that ACO can generate an efficient tourism route and provides a computational basis for developing a tourism route decision-support system.
Jaringan kolaborasi para penulis
4 penulis ·
4 tautan kepenulisan bersama
· 2 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Telkom University Universitas Amikom Purwokerto
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/journals/edukom/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en">Tourism Route Optimization Based on the Travelling Salesman Problem Using Ant Colony Optimization in the Banyumas and Purbalingga Regions</dc:title>
<dc:creator xml:lang="en">Putratama, Teddy</dc:creator>
<dc:creator xml:lang="en">Fernandez, Sandhy</dc:creator>
<dc:subject xml:lang="en">Ant Colony Optimization Algorithm</dc:subject>
<dc:subject xml:lang="en">Route Optimization</dc:subject>
<dc:subject xml:lang="en">Tourism Route</dc:subject>
<dc:subject xml:lang="en">Travelling Salesman Problem</dc:subject>
<dc:description xml:lang="en">Tourism route planning requires an efficient visiting sequence to reduce travel distance and transportation costs. When multiple tourist destinations must be visited in a single trip, the route-planning problem can be formulated as a Travelling Salesman Problem (TSP). This study implements Ant Colony Optimization (ACO) to determine an efficient route among 12 tourist destinations in Banyumas and Purbalingga. The destinations were represented as nodes in a weighted graph, while the travel distance between each pair of destinations was used as the edge weight. The algorithm constructed candidate routes using probabilistic selection and updated pheromone values based on route quality. Three pheromone evaporation rates, namely ρ=0.3, ρ=0.5, and ρ=0.7, were evaluated. The shortest route obtained in the first iteration was W1–W3–W2–W4–W8–W9–W7–W10–W11–W12–W6–W5–W1, with a total distance of 109.0 km. After pheromone updating, the pheromone levels on the shortest-route edges were 0.016174, 0.014174, and 0.012174 for evaporation rates of 0.3, 0.5, and 0.7, respectively. These results show that the evaporation rate directly affects pheromone retention, with a lower evaporation rate maintaining stronger pheromone information on the selected route. The study demonstrates that ACO can generate an efficient tourism route and provides a computational basis for developing a tourism route decision-support system.</dc:description>
<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
<dc:date>2026-08-31</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://journal.unnes.ac.id/journals/edukom/article/view/41805</dc:identifier>
<dc:identifier>10.15294/edukom.v13i1.41805</dc:identifier>
<dc:source xml:lang="en">Edu Komputika Journal; Vol. 13 No. 1 (2026): Edu Komputika Journal; 55-64</dc:source>
<dc:source>2599-297X</dc:source>
<dc:source>2252-6811</dc:source>
<dc:source>10.15294/edukom.v13i1</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://journal.unnes.ac.id/journals/edukom/article/view/41805/11414</dc:relation>
<dc:rights xml:lang="en">Copyright (c) 2026 Edu Komputika Journal</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
Putratama, T., & Fernandez, S. (2026). Tourism Route Optimization Based on the Travelling Salesman Problem Using Ant Colony Optimization in the Banyumas and Purbalingga Regions. Edu Komputika Journal, 13(1), 55–64. https://doi.org/10.15294/edukom.v13i1.41805
Salin
IEEE
T. Putratama and S. Fernandez, “Tourism Route Optimization Based on the Travelling Salesman Problem Using Ant Colony Optimization in the Banyumas and Purbalingga Regions,” Edu Komputika Journal, vol. 13, no. 1, pp. 55–64, 2026, doi: 10.15294/edukom.v13i1.41805.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.