Penerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program
Abstract
This optimization is an optimization case that organizes all possible and feasible solutions in discrete form. One form of combinatorial optimization that can be used as material in testing a method is the Traveling Salesman Problem (TSP). In this study, the bat algorithm will be used to find the optimum value in TSP. Utilization of the Metaheuristic Algorithm through the concept of the Bat Algorithm is able to provide optimal results in searching for the shortest distance in the case of TSP. Based on trials conducted using data on the location of student street vendors, the Bat Algortima is able to obtain the global minimum or the shortest distance when compared to the nearest neighbor method, Hungarian method, branch and bound method.
Downloads
References
S. Rohman, L. Zakaria, A. Asmiati, and A. Nuryaman, “Optimisasi Travelling Salesman Problem dengan Algoritma Genetika pada Kasus Pendistribusian Barang PT. Pos Indonesia di Kota Bandar Lampung,” J. Mat. Integr., vol. 16, no. 1, p. 61, 2020, doi: 10.24198/jmi.v16.n1.27804.61-73.
M. Iqbal, M. Zarlis, T. Tulus, and H. Mawengkang, “Model Pendekatan Metaheuristik Dalam Penyelesaian optimisasi Kombinatorial,” Semin. Nas. Teknol. Komput. Sains, vol. 1, no. 1, pp. 92–97, 2020.
R. Naufal, “Implementasi Firefly Algorithm - Tabu Search Untuk Penyelesaian Traveling Salesman Problem,” vol. 2, no. 1, pp. 42–48, 2017.
E. F. G. Goldbarg, G. R. De Souza, and M. C. Goldbarg, “Particle swarm for the traveling salesman problem,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 3906 LNCS, no. September, pp. 99–110, 2006, doi: 10.1007/11730095_9.
R. Strange, A. Y. Yang, and L. Cheng, “Discrete Flower Pollination Algorithm for Solving the Symmetric Travelling Salesman Problem,” 2019 IEEE Symp. Ser. Comput. Intell. SSCI 2019, pp. 2130–2137, 2019, doi: 10.1109/SSCI44817.2019.9002797.
V. Julianto, “Penerapan Hybrid Bat Algorithm ( BA ) dengan Differential Evolution ( DE ) untuk Mengoptimasi Model Multiobjektif,” vol. 2, pp. 130–135, 2016.
V. Julianto, D. Jurusan, T. Informatika, P. Negeri, and T. Laut, “Optimasi Model Multiobjektif Menggunakan Gabungan Algoritma Kelelawar Dengan Differential Evolution ( De ) Dan Levy Flight,” Seminar Nasional Hasil Penelitian dan Pengabdian Kepada Masyarakat (SNP2M) Politeknik Negeri Ujung Pandang, pp. 159–164, 2017.
Copyright (c) 2021 Jurnal Ilmiah Informatika
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Abstract viewed = 498 times
PDF downloaded = 444 times
