Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem

Abstract Most real world combinatorial optimization problems are difficult to solve with multiple objectives which have to be optimized simultaneously. Over the last few years, researches have been proposed several ant colony optimization algorithms to solve multiple objectives. The aim of this paper is to review the recently proposed multi-objective ant colony optimization (MOACO) algorithms and compare their performances on two, three and four objectives with different numbers of ants and numbers of iterations. Moreover, a detailed analysis is performed for these MOACO algorithms by applying them on several multi-objective benchmark instances of the traveling salesman problem. The results of the analysis have shown that most of the considered MOACO algorithms obtained better performances for more than two objectives and their performance depends slightly on the number of objectives, number of iterations and number of ants used.

[1]  Ahmad Rabanimotlagh,et al.  An Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem , 2011 .

[2]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[3]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[4]  Yuefeng Li,et al.  Granule Based Intertransaction Association Rule Mining , 2007 .

[5]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[6]  Günther R. Raidl,et al.  Evolutionary Computation in Combinatorial Optimization (vol. # 3906) : 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings , 2006 .

[7]  Shweta Singh,et al.  MULTI OBJECTIVE OPTIMIZATION OF TIME COST QUALITY QUANTITY USING MULTI COLONY ANT ALGORITHM , 2012 .

[8]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Hussein A. Abbass,et al.  Performance analysis of elitism in multi-objective ant colony optimization algorithms , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  Gishantha I. F. Thantulage.  Ant colony optimization based simulation of 3d automatic hose/pipe routing , 2009 .

[11]  Christine Solnon,et al.  Ant Colony Optimization for Multi-Objective Optimization Problems , 2007 .

[12]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[13]  Benjamín Barán,et al.  A Multiobjective Ant Colony System for Vehicle Routing Problem with Time Windows , 2003, Applied Informatics.

[14]  Benjamín Barán,et al.  Solving multiobjective multicast routing problem with a new ant colony optimization approach , 2005, LANC '05.

[15]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[16]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[17]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[18]  Daniel Angus,et al.  Crowding Population-based Ant Colony Optimisation for the Multi-objective Travelling Salesman Problem , 2007, 2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making.

[19]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[20]  Francisco Herrera,et al.  A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP , 2007, Eur. J. Oper. Res..