skip to main content

PERBANDINGAN ALGORITMA NEAREST NEIGHBOR DAN ANT COLONY OPTIMIZATION DALAM OPTIMASI RUTE WISATA SEMARANG BERBASIS MULTI-ATTRIBUTE UTILITY THEORY

Ashilah Tsuraya Izzati  -  Department of Statistics, Universitas Diponegoro, Jl. Prof. Sudarto, SH, Tembalang, Semarang, Indonesia 50275, Indonesia
*hasbi yasin  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Triastuti Wuryandari  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Open Access Copyright 2026 Jurnal Gaussian under http://creativecommons.org/licenses/by-nc-sa/4.0.

Citation Format:
Abstract
Tourism route planning is an important aspect of tourism development to improve travel efficiency and destination quality. This study aims to determine priority tourist destinations and to compare the performance of tourism route optimization methods in Semarang. Priority destinations are identified using the Multi-Attribute Utility Theory (MAUT) with criteria weights determined by the Rank Order Centroid (ROC). Tourism destinations with the highest utility values are selected as priority destinations and modelled as Traveling Salesman Problem (TSP). Tourism route optimization is carried out by comparing three optimization problem-solving method, namely exact method, heuristic method, and metaheuristic method. The exact method employs the Branch and Bound (B&B) algorithm as a benchmark to obtain the optimal solution. The heuristic method uses the Nearest Neighbour (NN) algorithm and metaheuristic method uses the Ant Colony Optimization (ACO) algorithm. Algorithm performance is evaluated based on total travel distance, computation time, and relative error (RE) to the optimal solution. The result show that the NN algorithm yields a relative error of 8.66%, while the ACO algorithm achieves a lower relative error of 2.2%. This indicates that ACO algorithm produces routes that are closer to the optimal solution.
Keywords: Muti-Attribute Utility Theory; Tourism Route Optimization; TravelingjSalesmanjProblem; BranchjandjBound; Nearestj Neighbor; Ant Colony Optimization

Article Metrics:

Article Info
Section: Articles
Language : ID
  1. Abbaspour, S., Aghsami, A., Jolai, F., dan Yazdani, M. 2022. An Integrated Queueing-Inventory-Routing Problem in a Green Dual-Channel Supply Chain Considering Pricing and Delivery period : a Case Study of Construction. Journal of Computational Design and Engineering Vol. 9, No.5, Hal: 1917–1951. DOI: 10.1093/jcde/qwac089
  2. Apriyani, D. C. N. 2024. Matematika Diskret (Graf). Pacitan: LPPM Press STKIP PGRI
  3. Aqila, Rangkuti, Y. M., Karo, I. M. K., dan Al-Idrus, S. I. 2024. Determining Tourist Destination Priorities Using Website-Based Particle Swarm Optimization Methods (Case Study : North Padang Lawas Regency). Journal of Mathematics, Computations and Statistics Vol. 7, No. 2, Hal: 371–379. DOI: 10.35580/jmathcos.v7i2.4233
  4. Dorigo, M., Maniezzo, V., dan Colorni, A. 1996. The Ant System : Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetic Vol. 26, No. 1, Hal: 1–13
  5. Gao, W. 2020. New Ant Colony Optimization Algorithm for the Traveling. International Journal of Computational Intelligence Systems Vol. 13, No. 1, Hal: 44-55. DOI: 10.2991/ijcis.d.200117.001
  6. Gunawan, I., Tambunan, H. S., dan Hartama, D. 2022. Monograf Algoritma Tabu Search dalam Kasus Traveling Salesman Problem. Indramayu: Penerbit Adab
  7. Ilhami, L. T. A., Ashari, M., dan Fadli, S. 2024. Sistem Pendukung Keputusan Seleksi Pemain Basket Menggunakan Metode SAW dengan Perbobotan ROC. Journal of Social Science Research Vol. 4, No. 3, Hal: 3073–3088
  8. Isnaeny, S. N., Puspita, D. D., dan Euigie, A. N. 2025. Analisis Algoritma Nearest Neighbor , Branch and Bound dan Dijkstra dalam Penyelesaian Travelling Salesman Problem ( TSP ). Universitas Negeri Malang
  9. Jaelani, I. 2016. Penerapan Algoritma Semut Untuk Optimasi Rute Penjemputan Barang Pada Tempat Jasa Penitipan Sementara Lion Express. Jurnal Ilmiah Sarjana Mahasiswa UMRAH Vol. 1, Hal: 1–14
  10. Karjono, Moedjiono, dan Kurniawan, D. 2016. Ant Colony Optimization. Jurnal TICOM Vol. 4, No. 3, Hal: 119-125
  11. Khan, A. A., dan Agrawal, H. 2016. A Comparative Study od Nearest Neighbour Algorithm and Genetic Algorithm in Solving Traveling Salesman Problem. International Research Journal of Engineering and Technology (IRJET) Vol. 3, No. 5, Hal: 234–238
  12. Klook Indonesia. 2025. 24 Rekomendasi Tempat Wisata di Semarang yang Wajib Kamu Kunjungi. Tersedia: https://www.klook.com/id/blog/rekomendasi-tempat-wisata-di-semarang/ (diakses pada tangga 4 November 2025)
  13. Margiyani, S., dan Mussafi, N. 2014. Aplikasi Algoritma Branch and Bound Untuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta. Jurnal Fourier Vol. 3, No. 1, Hal: 59–66
  14. Munir, R. 2009. Matematika Diskrit (Edisi Ketiga). Bandung: Informatika Bandung
  15. Munir, R. 2015. Metode Numerik. Bandung: Informatika Bandung /
  16. Mutakhiroh, I., Saptono, F., Hasanah, N., dan Wiryadinata, R. 2007. Pemanfaatan Metode Heuristik dalam Pencarian Jalur Terpendek dengan Algoritma Semut dan Algoritma Genetika. Prosiding Seminar Nasional Aplikasi Teknologi Informasi 2007, Universitas Islam Indonesia: 16 Juni 2007
  17. Nuroji, N. 2022. Penerapan Multi-Attribute Utility Theory (MAUT) Dalam Penentuan Pegawai Terbaik. Jurnal Ilmiah Informatika Dan Ilmu Komputer Vol. 1, No. 2, Hal: 46-53. DOI: 10.58602/jima-ilkom.v1i2.7
  18. Prasetio, S. A. J., dan Suseno. 2024. Optimasi Rute dengan Metode Ant Colony Optimization dan Nearest Neighbor di Perusahaan Yellow Moon Production. Jurnal Multidisiplin Ilmu Akademik Vol. 2, No. 6, Hal: 619–632. DOI: 10.61722/jmia.v1i3.1621
  19. Putra, A. G. P. H., Solikah, E. A., dan Nisak, S. A. 2023. Penerapan Algoritma Nearest Neighbor dalam Permasalahan TSP untuk Menentukan Rute Terpendek Pendistribusian Krupuk Rengginang. Jurnal Pendidikan Matematika Vol. 10, No. 2, Hal: 59–68. DOI: 10.18592/jpm.v10i2.9756
  20. Sembiring, M. T., dan Chailes, S. 2020. Ant Colony Optimization Implementation on Traveling Salesman Problem to Achieve the Shortest Logistic Route. 2nd International Conference on Industrial and Manufacturing Engineering, Universitas Sumatera Utara: 3-4 September 2020
  21. Sholihaningtias, D. N. 2023. Penerapan Kombinasi Metode MAUT dan ROC Dalam Seleksi Karyawan. Techno.Com Vol. 22, No. 1, Hal: 145–155. DOI: 10.33633/tc.v22i1.7480
  22. Wira, A. 2019. Sistem Pendukung Keputusan Pemilihan PimpinanDengan MetodeMulti Attribute Utility Theory (MAUT) di PT.Sagami Indonesia. Jurnal Mantik Vol. 3, No. 2, Hal: 10–19
  23. Witin, S. S. G., Permatasari, W. D., Aminah, N., Rande, P., Amijaya, F. D. T., dan Putri, D. F. 2025. Penerapan Algoritma Branch and Bound untuk Optimasi Rute Wisata Kalimantan Timur Berdasarkan Traveling Salesman Problem. Jurnal Ilmiah Matematika Vol. 13, No. 2, Hal: 198–199
  24. Zukhruf, F., dan Frazila, R. B. 2021. Pengantar Optimasi dalam Rekayasa Transportasi. Bandung: ITB Press

Last update:

No citation recorded.

Last update:

No citation recorded.