A Hybrid Firefly Algorithm – Ant Colony Optimization for Traveling Salesman Problem

Abstract:  In  this  paper,  we  develop  a  novel  method  hybrid  firefly  algorithm-ant  colony optimization  for  solving  traveling  salesman  problem.  The  ACO  has  distributed computation  to  avoid  premature  convergence  and  the  FA  has  a  very  great  ability  to search  solutions  with  a  fast  speed  to  converge.  To  improve  the  result  and  convergence time, we used hybrid method. The hybrid approach involves local search by the FA and global search by the ACO. Local solution of FA is normalized and is used to initialize the pheromone for the global solution search using the ACO. The outcome are compared with FA and ACO itself. The experiment showed that the proposed method can find the solution much better without trapped into local optimum with shorter computation time.
Keywords: Traveling  Salesman  Problem,  Firefly  Algorithm,  Ant  Colony  Optimization, hybrid method
Author: Olief Ilmandira Ratu Farisi, Budi Setiyono, R. Imbang Danandjojo
Journal Code: jptinformatikagg160001

Artikel Terkait :

Jp Teknik Informatika gg 2016