Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP

Ant Colony Optimization (ACO) is a bioinspired metaheuristic based on ants foraging used to solve different classes of problems. In this paper, we show how, using a Two-Stage approach the quality of the solutions of ACO is improved. The Two-Stage approach can be applied to different ACO. The performance of this new approach is studied in the Traveling Salesman Problem and Quadratic Assignment Problem. The experimental results show that the obtained solutions are improved both problems using the Two-Stage approach. Several statistical procedures are applied to show the effect of this new approach.

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  S. E. Karisch,et al.  QAPLIB-A quadratic assignment problem library , 1991 .

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

[4]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

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

[6]  Rafael Bello,et al.  Two-Stage ACO to Solve the Job Shop Scheduling Problem , 2007, CIARP.

[7]  Lin-Yu Tseng,et al.  A Hybrid Metaheuristic for the Quadratic Assignment Problem , 2006, Comput. Optim. Appl..

[8]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

[9]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[10]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[11]  S. García,et al.  An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons , 2008 .

[12]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[13]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[14]  Rafael Bello,et al.  Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem , 2007, IWINAC.

[15]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[16]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[17]  Hossein Miar Naimi,et al.  New robust and efficient ant colony algorithms: Using new interpretation of local updating process , 2009, Expert Syst. Appl..

[18]  Francisco Herrera,et al.  A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability , 2009, Soft Comput..

[19]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[20]  S. P. Wright,et al.  Adjusted P-values for simultaneous inference , 1992 .

[21]  Francisco Herrera,et al.  A study on the use of statistical tests for experimentation with neural networks: Analysis of parametric test conditions and non-parametric tests , 2007, Expert Syst. Appl..

[22]  Zhilu Wu,et al.  Population declining ant colony optimization algorithm and its applications , 2009, Expert Syst. Appl..

[23]  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..

[24]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[25]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[26]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[27]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

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

[29]  R. Iman,et al.  Approximations of the critical region of the fbietkan statistic , 1980 .

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

[31]  Francisco Herrera,et al.  Analysis of the Best-Worst Ant System and Its Variants on the QAP , 2002, Ant Algorithms.

[32]  T. Yalcinoz,et al.  Implementing soft computing techniques to solve economic dispatch problem in power systems , 2008, Expert Syst. Appl..

[33]  S. Holm.  A Simple Sequentially Rejective Multiple Test Procedure , 1979 .

[34]  M. Friedman.  The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .

[35]  David J. Sheskin,et al.  Handbook of Parametric and Nonparametric Statistical Procedures , 1997 .

[36]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[37]  Richard F. Hartl,et al.  A MAX-MIN ant system for unconstrained multi-level lot-sizing problems , 2007, Comput. Oper. Res..