Aplikasi Hybrid Firefly Algorithm untuk Pemecahan Masalah Traveling Salesman: Studi Kasus pada PT Anugerah Mandiri Success
Determining a good route is a major problem in a transport process in the company. This case study aims to overcome the problem of determining the route or often called the Traveling Salesman Problem (TSP) is optimal. This problem will be solved by the optimization method in determining the route, w...
Main Authors: | J. Sudirwan, Siti Nur Fadlilah, Teguh Teguh |
---|---|
Format: | Article |
Language: | English |
Published: |
Bina Nusantara University
2014-12-01
|
Series: | ComTech |
Subjects: | |
Online Access: | https://journal.binus.ac.id/index.php/comtech/article/view/2281 |
Similar Items
-
Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm
by: Ravneil Nand, et al.
Published: (2024-01-01) -
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007) -
Efficient Computation and Estimation of the Shapley Value for Traveling Salesman Games
by: Chaya Levinger, et al.
Published: (2021-01-01) -
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
by: Mohammed Zia, et al.
Published: (2018-03-01)