The Comparison of the Nearest Neighbor and Modified Sollin Algorithms for Determining the Shortest Tour for BNI Bank Branches in Lampung Province
Article Sidebar
Main Article Content
Abstract
BNI is one of the government -owned banks in Indonesia. At certain times, BNI experiences a significant increase in the number of customers, which can lead to long queues. In such situations, customers generally consider visiting other BNI branches. To optimize time and cost, it is necessary to have information to determine the shortest tour between BNI locations in Lampung Province. The purpose of this study is to determine the shortest tour among 21 BNI locations in Lampung Province. The results show that both the Nearest Neighbor Heuristic Algorithm and the Modified Sollin’s Algorithm produce the same solution for Euclidean distance data and Haversine distance data. However, for time-based data, the Modified Sollin’s Algorithm performs better than the Nearest Neighbor Heuristic Algorithm.
Article Details
References
[1] Besan A AlSalibi, Marzieh Babaeian Jelodar, and Ibrahim Venkat. A Comparative Study between the Nearest Neighbor and Genetic Algorithms: A Revisit to the Traveling Salesman Problem. International Journal of Computer Science and Electronics Engineering (IJCSEE), 1(1):110–123, 2013
[2] Rizki Putra Sinaga and Faridawaty Marpaung. Perbandingan Algoritma Cheapest Insertion Heuristic dan Nearest Neighbor Dalam Menyelesaikan Traveling Salesman Problem. Jurnal Riset Rumpun Matematika dan Ilmu Pengetahuan Alam, 2(2):238–247, 2023
[3] Abdi Restu Dinata, Wamiliana Wamiliana, Muslim Ansori, Fitriani Fitriani, and Notiragayu Notiragayu. Determining the Shortest Tour Location of Tourist Attractions in Bandar Lampung Using Cheapest Insertion Heuristic (CIH) and Modified Sollin Algorithm. Jurnal Pepadun, 6(1):92–102, 2025
[4] Meli Amelia, Ilma Isyahna Sholeha, Yanda Rico Revangga, and Wamiliana Wamiliana. The Comparison of Brute Force, Cheapest-Insertion, and Nearest-Neighbor Heuristics for Determining the Shortest Tour for Visiting Malls in Bandar Lampung. EXPERT, 14(1):51–54, 2024
[5] Sriyani Violina. Analysis of Brute Force and Branch & Bound Algorithms to Solve the Traveling Salesperson Problem (TSP). Turkish Journal of Computer and Mathematics Education, 12(8):1226–1229, 2021
[6] Annisa Salsabila, Nadhir Rotun Nikmah, Rafif Syadid Bakhtiananda, Micelle Yap Aswin, and Dina Eka Nurvazly. Products Distribution from Suppliers to Retailers in Bandarlampung City (Case Study: Retailers location in Teluk Betung). Integra: Journal of Integrated Mathematics and Computer Science, 1(1):6–12, 2024
[7] Nur Wafiqoh Hadi, Rehsya Nurfabella, Mira Mustika, et al. Comparative Analysis of CIH and Christofides Algorithms for Optimal Tourist Route Planning in West Java. Integra: Journal of Integrated Mathematics and Computer Science, 2(2):56–62, 2025
[8] Micelle Yap Aswin, Wamiliana Wamiliana, Fitriani Fitriani, Muslim Ansori, and Notiragayu Notiragayu. Perbandingan Cheapest Insertion Heuristic dan Algoritma Christofides Untuk Menentukan Tour Pasar Tradisional di Kota Bandar Lampung. Jurnal Pepadun, 5(2):182–194, 2024
[9] Farid Fargiana, Respitawulan Respitawulan, Yusuf Fajar, Didi Suhaedi, and Erwin Harahap. Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route. International Journal of Global Operations Research, 3(2):37–45, 2022
[10] Sameer A Nene and Shree K Nayar. A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(9):989–1003, 2002
[11] Md Ziaur Rahman, Sakibur Rahamn Sheikh, Ariful Islam, and Md Azizur Rahman. Improvement of the Nearest Neighbor Heuristic Search Algorithm for Traveling Salesman Problem. Journal of Engineering Advancements, 5(01):19–26, 2024
[12] Anie Lusiani, Siti Samsiyah Purwaningsih, and Euis Sartika. TSP Method Using Nearest Neighbor Algorithm at PT. J&T Express in Bandung. Jurnal Lebesgue: Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika, 4(3):1560–1568, 2023
[13] Stefan Hougardy and Mirko Wilde. On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem. Discrete Applied Mathematics, 195:101–103, 2015
[14] Dwi Rizka Amelia Putri, Niken Sabella Oktavia, Siti Laelatul Chasanah, Riza Sawitri, and Felicia Andrade Paskalia. Implementation of Christofides Algorithm to Determine the Shortest Tour of Some Hospitals in Palembang City. Integra: Journal of Integrated Mathematics and Computer Science, 2(1):15–19, 2025
[15] Zhou Xu and Brian Rodrigues. An Extension of the Christofides Heuristic for the Generalized Multiple Depot Multiple Traveling Salesmen Problem. European Journal of Operational Research, 257(3):735–745, 2017
[16] Noraini Mohd Razali, John Geraghty, et al. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP. In Proceedings of the World Congress on Engineering, volume 2, pages 1–6. International Association of Engineers Hong Kong, China, 2011
[17] Darius Bethel and Hakki Erhan Sevil. Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA Based Solutions. International Journal of Recent Contributions from Engineering, Science & IT, 9:44–56, 2021
[18] Ulviye Hacizade and I Kaya. GA Based Traveling Salesman Problem Solution and Its Application to Transport Routes Optimization. IFAC-PapersOnLine, 51(30):620–625, 2018
[19] AB Doumi, BA Mahafzah, and H Hiary. Solving Traveling Salesman Problem Using Genetic Algorithm Based on Efficient Mutation Operator. Journal of Theoretical and Applied Information Technology, 99(15):3768–3781, 2021
[20] David B Fogel. An Evolutionary Approach to the Traveling Salesman Problem. Biological Cybernetics, 60(2):139–144, 1988
[21] Mohammad Asim, Ritika Gopalia, and Shivalika Swar. Traveling Salesman Problem Using Genetic Algorithm. International Journal of Latest Trends in Engineering and Technology (IJLTET), 3(3):183–190, 2014
[22] Xuan-Shi Yao, Yun Ou, and Kai-Qing Zhou. TSP Solving Utilizing Improved Ant Colony Algorithm. In Journal of Physics: Conference Series, volume 2129, page 012026. IOP Publishing, 2021
[23] Marco Dorigo and Luca Maria Gambardella. Ant Colonies for the Travelling Salesman Problem. Biosystems, 43(2):73–81, 1997
[24] Eka Ardhianto, Endang Lestariningsih, Widiyanto Tri Handoko, and R Soelistijadi. Pemanfaatan Peta Google Sebagai Sarana Promosi Melalui Penandaan Lokasi Usaha Rumahan Di Paguyuban Warga Lentera Prigi Mranggen Demak. Jurnal Pengabdian Masyarakat Intimas (Jurnal INTIMAS): Inovasi Teknologi Informasi dan Komputer Untuk Masyarakat, 2(2):78–83, 2022
[25] Ricky Ramadhan Harahap and Hidayatullah Hidayatullah. Sistem Informasi Google Maps Dengan Menggunakan VB. NET. Journal of Science and Social Research, 1(1):36–41, 2018
[26] Wamiliana Wamiliana. Minimum Spanning Tree dan Desain Jaringan, 2022
[27] Canggih Ajika Pamungkas. Aplikasi Penghitung Jarak Koordinat Berdasarkan Latitude Dan Longitude Dengan Metode Euclidean Distance Dan Metode Haversine. Jurnal Informa: Jurnal Penelitian dan Pengabdian Masyarakat, 5(2):8–13, 2019
[28] Yulianto Yulianto, Ramadiani Ramadiani, and Awang Harsa Kridalaksana. Penerapan Formula Haversine Pada Sistem Informasi Geografis Pencarian Jarak Terdekat Lokasi Lapangan Futsal. Informatika Mulawarman: Jurnal Ilmiah Ilmu Komputer, 13(1):14, 2018