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...
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: | |
Online Access: | https://journal.ibrahimy.ac.id/index.php/JIMI/article/view/1485/1120 |
Similar Items
-
Permutation rules and genetic algorithm to solve the traveling salesman problem
by: Jihene Kaabi, et al.
Published: (2019-01-01) -
D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm
by: Poria Pirozmand, et al.
Published: (2023-01-01) -
Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing
by: I Iryanto, et al.
Published: (2021-12-01) -
An Improved Unordered Pair Bat Algorithm for Solving the Symmetrical Traveling Salesman Problem
by: Nan Zhang, et al.
Published: (2022-02-01) -
APPLICATION OF GENETIC ALGORITHMS TO THE TRAVELING SALESMAN PROBLEM
by: Tomasz SIKORA, et al.
Published: (2023-06-01)