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

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

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 op...

Full description

Bibliographic Details
Main Authors: Veri Julianto, Hendrik Setyo Utomo, Muhammad Rusyadi Arrahimi
Format: Article
Language:Indonesian
Published: Fakultas Sains dan Teknologi, Universitas Ibrahimy 2021-12-01
Series:Jurnal Ilmiah Informatika
Subjects:
bat algorithm
optimization
tsp
metaheuristic
permutation
Online Access:https://journal.ibrahimy.ac.id/index.php/JIMI/article/view/1485/1120

Internet

https://journal.ibrahimy.ac.id/index.php/JIMI/article/view/1485/1120

Similar Items