Implementation of the Traveling Salesman Problem (TSP) Algorithm in Determining the Shortest Route for Sailing Routes for Aplousing and SBNP Maintenance Activities in the Working Area of the Tanjung Perak Type A District Navigation Office

Penerapan Model TSP dalam Efisiensi Operasional Maritim

Authors

  • ADE IRFAN EFENDI Politeknik Transportasi Darat Indonesia - STTD

DOI:

https://doi.org/10.32493/jtsi.v8i4.50429

Keywords:

Traveling Salesman Problem; TSP Algorithm; Shipping; Route Optimization; Efficiency.

Abstract

This study aims to optimize routes to improve fuel efficiency and voyage time, as well as reduce environmental pollution from state ship operations in Aplousing and Navigation Aid Maintenance (SBNP) activities in the working area of the Tanjung Perak Type A Class I Navigation District. To achieve this objective, the Traveling Salesman Problem (TSP) algorithm was applied to determine the shortest route connecting 11 port locations and islands in the waters of East Java. Two algorithmic approaches proposed in this study are the Heuristic Nearest Neighbor and Brute Force methods. Simulation results show that the Brute Force approach produces the most optimal route with a total distance of ± 1,095.94 km, which is more efficient than the Heuristic Nearest Neighbor approach at ± 1,110.33 km and the initial route without optimization at ± 1,284. The reduction in distance traveled has a positive impact on reducing fuel consumption, sailing time, and exhaust emissions. This study demonstrates that the application of the TSP algorithm can improve operational efficiency in shipping and can serve as a foundation for developing technology-based decision support systems for more environmentally friendly shipping route management.

References

Akhmad Ismail, A., & Herdjunanto, S. (2012). Penerapan Algoritma Ant System dalam Menemukan Jalur Optimal pada Traveling Salesman Problem (TSP) dengan Kekangan Kondisi Jalan. In JNTETI (Vol. 1, Issue 3). http://www.iwr.uni-

Amin Siddiq Sumi, & Purnawansyah. (2018). Analisa Penerapan Algoritma Brute Force Dalam Pencocokan String. 3, 88–92.

Baharuddin, M. M., Azis, H., & Hasanuddin, T. (2019). Analisis Performa Metode K-Nearest Neighbor Untuk Identifikasi Jenis Kaca. ILKOM Jurnal Ilmiah, 11(3), 269–274. https://doi.org/10.33096/ilkom.v11i3.489.269-274

Condro Wibawa. (2022). Optimalisasi Rute Wisata Di Yogyakarta Menggunakan Metode Travelling Salesman Person Dan Algoritma Brute Force. Jurnal Teknik Dan Science, 1(3), 59–65. https://doi.org/10.56127/jts.v1i3.512

Dobry Sianipar, F., Arifin, M. H., Aulia, W., Prodi, H., Komputer, I., Mipa, F., Medan, N., William, J., Ps, I. V, Estate, M., Sei, K. P., Kabupaten, T., Serdang, D., & Utara, S. (2024). Estimasi Rute Terdekat Dari Universitas Negeri Medan Ke Spbu Terdekat Menggunakan Algoritma Greedy. In Jurnal Mahasiswa Teknik Informatika (Vol. 8, Issue 6).

Firdaus, A., Muklason, A., Supoyo, V. A., Sepuluh, I. T., & Surabaya, N. (2021). Perbandingan Metode Penyelesaian Permasalahan Optimasi Lintas Domain Dengan Pendekatan Hyper-Heuristic Menggunakan Algoritma Reinforcement Learning-Late Acceptance Comparison Of Cross Domain Optimization Completion Method For Hyper-Heuristic Approach Using Reinforcement Learning-Late Acceptance Algorithm. 8(5), 871–878. https://doi.org/10.25126/jtiik.202183263

Gohil, A., Tayal, M., Sahu, T., & Sawalpurkar, V. (2022). Travelling Salesman Problem: Parallel Implementations & Analysis. http://arxiv.org/abs/2205.14352

Hariski, F., Triayudi, A., & Soepriyono, G. (2023). Implementasi Algoritma Brute Force Pada Sistem Pertanahan di Balai Desa. Journal of Computer System and Informatics (JoSYC), 4(3), 701–709. https://doi.org/10.47065/josyc.v4i3.3520

Irfan, M. (2017). Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB. 16(2). https://ejournal.unisba.ac.id

Martono, S., & Warnars, H. L. H. S. (2020). Penentuan Rute Pengiriman Barang Dengan Metode Nearest Neighbor. PETIR, 13(1), 44–57. https://doi.org/10.33322/petir.v13i1.869

Maulidan, M., Gunawan, G., & Fajar, M. (2023). Perbandingan Algoritma K-Nearest Neighbor, Greedy dan Brute Force dalam Menentukan Rute Pengiriman Barang. Bandung Conference Series: Mathematics, 3. https://doi.org/10.29313/bcsm.v3i1.6403

Muhamad Adzaky, G., Traveling Salesman Problem, O., & Wahid Saleh Insani, R. (2023). Optimasi Traveling Salesman Problem (Tsp) Menggunakan Algoritma Genetika Dan Google Maps Api Untuk Kurir Ekspedisi Pada J&T Paris 2 Berbasis Web Gis. INSERT: Information System and Emerging Technology Journal, 4(2), 119.

Muhammadiyah Mataram, U., Rahman Hadi, A., Mandalina, V., & studi Pendidikan matematika, P. (2024). Seminar Nasional Paedagoria Evaluasi Perbandingan Penggunaan Metode Heuristik Dan Algoritma Optimasi Dalam Menyelesaikan Masalah Kombinasi Pada Matematika Diskrit.

Pratama, E., Indra, Z., Alby, M., Hsb, S., & Fauzan, R. (2025). Penerapan Algoritma Brute Force Untuk Optimasi Strategi Tim Permainan Sepak Bola. JETISH: Journal of Education Technology Information Social Sciences and Health E-ISSN, 4, 486–490.

Rahmah, S. A. (2023). JCBD JOURNAL OF COMPUTERS AND DIGITAL BUSINESS Efektifitas Penerapan Algoritma Brute Force dan Penyalahgunaannya Dalam Sistem Berbasis Web. 2(3), 112–119. https://doi.org/10.56427/jcbd.v2n3.235

Rahman, Md. A., & Parvez, H. (2021). Repetitive Nearest Neighbor Based Simulated Annealing Search Optimization Algorithm for Traveling Salesman Problem. OALib, 08(06), 1–17. https://doi.org/10.4236/oalib.1107520

Rismayani, R., Sambo Layuk, N., Wahyuni, S., Wali, H., & Marselina, N. K. (2021). Pencarian Kata Pada Aplikasi Kamus Istilah Komputer dan Informatika Menggunakan Algoritma Brute Force Berbasis Android. Komputika : Jurnal Sistem Komputer, 10(1), 43–52. https://doi.org/10.34010/komputika.v10i1.3644

Rizka Gunawan, C. (2024). Optimasi Travelling Salesman Problem Berbasis Algoritma Genetika dengan Probabilitas Crossover dan Mutasi Adaptif Optimization of the Travelling Salesman Problem Based on Genetic Algorithm with Adaptive Crossover and Mutation Probabilitie. https://jurnal.unity-academy.sch.id/index.php/jirsi/index

Sabdana, C. B., Christopher, B., Sutanto, J. G., Sianto, L. P., Hariyanto, L., & Hartono, N. (2023). Implementasi Algoritma Evolusi FHO, MVPA, dan HHO pada TSP di Tempat Pariwisata Pulau Bali. Journal of Intelligent System and Computation, 5(1), 46–57. https://doi.org/10.52985/insyst.v5i1.260

Sanggala, E., & Bisma, M. A. (2023). Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances. Jurnal Media Teknik Dan Sistem Industri, 7(1), 27. https://doi.org/10.35194/jmtsi.v7i1.3039

Shi, H., Zheng, L., & Liu, G. (2022). Research on TSP based on ant colony algorithm. 2015 IEEE International Conference on Information and Automation, 2048–2051. https://doi.org/10.1109/ICInfA.2015.7279626

Sologia, F., Aurachman, R., Giri, P., & Kusuma, A. (2020). Rekomendasi Rute Wisata Menggunakan Metode Travelling Salesman Problem Dengan Algoritma K-Nearest Neighbor (Studi Kasus : Toraja Utara) Tourism Route Recomendation Using Travelling Salesman Problem Method With K-Nearest Neighbor Algorithm (Study Case : Toraja Utara).

Sutoyo, Labu, P., & Selatan, J. (2018). Penerapan Algoritma Nearest Neighbour untuk Menyelesaikan Travelling Salesman Problem. XX(1).

Suwarman, H. R. (2021). Evaluasi Penerapan Evolutionary Algorithm Untuk Pemecahan Traveling Salesman Problem. 09. http://www.solver.com

Wahyu Nur Hidayah, R., Rubhasy, A., & Nasional, U. (2021). Algoritma Brute Force Pada Aplikasi Kritik Dan Saran Mahasiswa Berbasis Digital Brute Force Algorithm In Digital-Based Student Criticism And Suggestion Applications. Journal of Information Technology and Computer Science (INTECOMS), 4(1).

Zhang, J., & Lin, X. (2022). An Adaptive Ant Colony Clustering Algorithm and Application in the TSP. 2022 International Conference on Computer Network, Electronic and Automation (ICCNEA), 82–85. https://doi.org/10.1109/ICCNEA57056.2022.00028

Downloads

Published

2025-10-31

How to Cite

EFENDI, A. I. (2025). Implementation of the Traveling Salesman Problem (TSP) Algorithm in Determining the Shortest Route for Sailing Routes for Aplousing and SBNP Maintenance Activities in the Working Area of the Tanjung Perak Type A District Navigation Office: Penerapan Model TSP dalam Efisiensi Operasional Maritim. Jurnal Teknologi Sistem Informasi Dan Aplikasi, 8(4), 323–332. https://doi.org/10.32493/jtsi.v8i4.50429

Issue

Vol. 8 No. 4 (2025): Jurnal Teknologi Sistem Informasi dan Aplikasi

Section

Article

License

Copyright (c) 2025 ADE IRFAN EFENDI

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

Jurnal Teknologi Sistem Informasi dan Aplikasi have CC BY-NC or an equivalent license as the optimal license for the publication, distribution, use, and reuse of scholarly work.

In developing strategy and setting priorities, Jurnal Teknologi Sistem Informasi dan Aplikasi recognize that free access is better than priced access, libre access is better than free access, and libre under CC BY-NC or the equivalent is better than libre under more restrictive open licenses. We should achieve what we can when we can. We should not delay achieving free in order to achieve libre, and we should not stop with free when we can achieve libre.

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) License

YOU ARE FREE TO:

  • Adapt - remix, transform, and build upon the material for any purpose, even commercially.
  • The licensor cannot revoke these freedoms as long as you follow the license terms