Record Details

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

Jurnal Ilmiah Informatika

View Archive Info
 
 
Field Value
 
Title Penerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program
 
Creator Julianto, Veri
Utomo, Hendrik Setyo
Arrahimi, Muhammad Rusyadi
 
Subject Bat Algorithm
Optimization
TSP
Metaheuristic
Permutation
 
Description 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.
 
Publisher Department of Science and Technology Ibrahimy University
 
Date 2021-12-31
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier https://journal.ibrahimy.ac.id/index.php/JIMI/article/view/1485
10.35316/jimi.v6i2.1485
 
Source Jurnal Ilmiah Informatika; Vol. 6 No. 2 (2021): Jurnal Ilmiah Informatika; 111-116
2549-6301
2549-7480
10.35316/jimi.v6i2
 
Language eng
 
Relation https://journal.ibrahimy.ac.id/index.php/JIMI/article/view/1485/1120
 
Rights Copyright (c) 2021 Jurnal Ilmiah Informatika
https://creativecommons.org/licenses/by-nc/4.0