R. Imbang Danandjojo
Kementerian Perhubungan Republik Indonesia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

A hybrid approach to multi-depot multiple traveling salesman problem based on firefly algorithm and ant colony optimization Olief Ilmandira Ratu Farisi; Budi Setiyono; R. Imbang Danandjojo
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 10, No 4: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v10.i4.pp910-918

Abstract

This study proposed a hybrid approach of firefly algorithm (FA) and ant colony optimization (ACO) for solving multi-depot multiple traveling salesman problem, a TSP with more than one salesman and departure city. The FA is fast converging but easily trapped into the local optimum. The ACO has a great ability to search for the solution but it converges slowly. To get a better result and convergence time, we integrate FA to find the local solutions and ACO to find a global solution. The local solutions of the FA are normalized then initialized to the quantity of pheromones for running the ACO. Furthermore, we experimented with the best parameters in order to optimize the solution. In justification, we used the sea transportation route in Indonesia as a case study. The experimental results showed that the hybrid approach of FA and ACO has superior performance with an average computational time of 26.90% and converges 32.75% faster than ACO.