Scientific Journal of Informatics
Vol. 6 No. 2 (2021): Jurnal Ilmiah Informatika

Penerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program

Veri Julianto (Politeknik Negeri Tanah Laut)
Hendrik Setyo Utomo (Politeknik Negeri Tanah Laut)
Muhammad Rusyadi Arrahimi (Politeknik Negeri Tanah Laut)

Article Info

Publish Date
31 Dec 2021

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.

Copyrights © 2021




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Scientific Journal of Informatics
Website

Abbrev

JIMI

Publisher

Universitas Ibrahimy

Subject

Computer Science & IT

Description

Topics cover the following areas (but are not limited to): 1. Information Technology (IT) a. Software engineering b. Game c. Information Retrieval d. Computer network e. Telecommunication f. Internet g. Wireless technology h. Network security i. Multimedia technology j. Mobile Computing k. ...