Simulation Of Traveling Salesman Problem For Distribution Of Fruits In Bogor City With Simulated Annealing Method Simulation Of Traveling Salesman Problem For Distribution Of Fruits In Bogor City With Simulated Annealing Method
Article Sidebar
Main Article Content
Abstract
Traveling Salesman Problem (TSP) is a problem of finding the shortest distance when a salesman visits a number of cities, provided that each city is visited exactly once and then returns to the initial city. TSP simulations for fruit distribution in Bogor city with each location having x and y coordinates as distances. The TSP used is a symmetrical TSP whose distance from city a to b has the same distance as city b to a. To solve and find solutions to problems using the Simulated Annealing (SA) Algorithm. The working principle is that at high temperatures metal liquid particles have a high energy level so it is relatively easy to move against other particles. Then as the temperature drops the particle slowly adjusts itself to form a configuration so that a stable state with a minimum energy level is obtained. This minimum energy is the shortest distance. Based on experiments that have been done using SA Algorithm on the TSP problem, the results show that the number of iterations that produce the optimal solution depends on the number of simulated locations. The more simulated location points, a large number of iterations are needed.
Downloads
Article Details
[2] Citra Nur Alpianty and J. Dharma Lesmono, “Penerapan Algoritma Simulated Annealing Untuk Menyelesaikan Asymmetric Travelling Salesman Problem,” in Seminar Nasional Matematika Vol.13, 2018, pp. 63–69.
[3] A. Meitrilova, F. M. Puspita, and Yahdin, “Implementasi Travelling Salesman Problem (Tsp) Dengan Algoritma Genetika Dan Simulated Annealing Pada Pendistribusian Pupuk Pt. Austindo Nusantara Jaya,” Sriwijaya University, 2017.
[4] R. Hidayati, I. Guntoro, and S. Junianti, “Penggunaan Metode Simulated Annealing Untuk Penyelesaian Travelling Salesman Problem,” 2019.
[5] Jose Rizal, “Optimasi Pada Traveling Salesman Problem (TSP) dengan Pendekatan Simulasi Annealing,” J. Gradien, vol. 3, no. 2, pp. 286–290, 2007.
[6] M. Hamdani Azmi and C. Farela Mada Tantrika, “Penjadwalan Produksi Rokok Untuk Meminimalkan Maximum Tardiness MenggunakanAlgoritma Simulated Annealing,” J. Rekayasa Dan Manaj. Sist. Ind., vol. 3, no. 2, pp. 353–362, 2015.
[7] Dany Purno Yuwono, “Penerapan Simulated Annealing Untuk Penjadwalan Matakuliah Di Jurusan Teknik Elektro Universitas Negeri Malang,” Universitas Negeri Malang, 2014.
[8] S. Vats and N. Bakshi, “Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem,” Int. J. Innov. Res. Technol., vol. 5, no. 3, pp. 272–275, 2018.
[9] Fatmawati, Bayu Prihandono, and Evi Noviani, “PenyelesaianTravelling Salesman ProblemDenganMetodeTabuSearch.,” Bul. Mat. Stat. dan Ter., vol. 4, no. 1, pp. 17–24, 2015.
[10] L. Wang, M. L. R. Cai, and Y. Zhong, “Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem,” IEEE Xplore Digit. Libr., pp. 144366–144380, 2019.
[11] ChangYing Wang, Min Lin, YiWen Zhong, and Hui Zhang, “Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling,” Int. J. Comput. Sci. Math., vol. 6, no. 4, 2015.
[12] Hüsamettin Bayram and Ramazan ?ahin, “A New Simulated Annealing Approach for Travelling Salesman Problem,” Math. Comput. Appl. , vol. 18, no. 3, pp. 313–322, 2013.