Open AccessPenerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program
Author(s) -
Veri Julianto,
Hendrik Setyo Utomo,
Muhammad Rusyadi Arrahimi
Publication year - 2021
Publication title -
jurnal ilmiah informatika
Language(s) - English
Resource type - Journals
eISSN - 2549-7480
pISSN - 2549-6301
DOI - 10.35316/jimi.v6i2.1485
Subject(s) - travelling salesman problem , bat algorithm , mathematical optimization , nearest neighbour algorithm , extremal optimization , computer science , combinatorial optimization , metaheuristic , algorithm , quadratic assignment problem , mathematics , particle swarm optimization , meta optimization
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.