A common interval guided ACO algorithm for permutation problems

Ant Colony Optimization (ACO) has been successfully applied to many combinatorial optimization problems. In this work we propose a new solution construction scheme for ACO. This scheme uses the common intervals of the current iteration's best solutions to guide the ants during solution construction. Firstly, we compared the performance of ACO and the proposed algorithm Common Interval ACO (CIACO). Secondly, we conducted an in-depth study for the CIACO algorithm to investigate the influence of the common interval guidance. For both experiments a large parameter space was used. The results show, that common intervals can be used to improve the solution quality in comparison to the standard ACO algorithm.

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

[2]  M. Dorigo,et al.  Aco Algorithms for the Traveling Salesman Problem , 1999 .

[3]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[4]  Ravi Shankar,et al.  An ant algorithm for the single row layout problem in flexible manufacturing systems , 2005, Comput. Oper. Res..

[5]  P.-P. Grasse La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[6]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[7]  Takeaki Uno,et al.  Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[8]  Donald M. Simmons One-Dimensional Space Allocation: An Ordering Algorithm , 1969, Oper. Res..

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Mathieu Raffinot,et al.  Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs , 2005, SIAM J. Discret. Math..

[11]  W. Marsden I and J , 2012 .

[12]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[13]  Ravi Kothari,et al.  The single row facility layout problem: state of the art , 2012 .

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

[15]  Jens Stoye,et al.  Finding All Common Intervals of k Permutations , 2001, CPM.

[16]  R. Brady Optimization strategies gleaned from biological evolution , 1985, Nature.

[17]  Matthias Bernt,et al.  Bioinformatics methods for the comparative analysis of metazoan mitochondrial genome sequences. , 2013, Molecular phylogenetics and evolution.

[18]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[19]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[20]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .