A common interval guided ACO algorithm for permutation problems

Proceedings of the 2013 IEEE Symposium on Swarm Intelligence, SIS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013

Volumn , Issue , 2013, Pages 64-71

  Clauss, Martin ^a   Bernt, Matthias ^a   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); COMBINATORIAL OPTIMIZATION PROBLEMS; COMMON INTERVALS; CONSTRUCTION SCHEME; IN-DEPTH STUDY; PARAMETER SPACES; PERMUTATION PROBLEMS; SOLUTION QUALITY;

ARTIFICIAL INTELLIGENCE; ITERATIVE METHODS;

ALGORITHMS;

EID: 84886801455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIS.2013.6615160     Document Type: Conference Paper

References (18)

1. P.-P. Grassé, "La reconstruction du nid et les coordinations interindividuelles chez bellicositermes natalensis et cubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs," Insectes Sociaux, vol. 6, pp. 41-80, 1959.
2. M. Dorigo and T. Stützle, Ant Colony Optimization. Scituate, MA, USA: Bradford Company, 2004.
3. J.-L. Deneubourg, S. Aron, S. Goss, and J. Pasteels, "The self-organizing exploratory pattern of the argentine ant," Journal of Insect Behavior, vol. 3, no. 2, pp. 159-168, 1990.
4. D. Goldberg, Genetic algorithms in search, optimization, and machine learning, ser. Artificial Intelligence. Addison-Wesley, 1989.
5. R. Brady, "Optimization strategies gleaned from biological evolution," Nature, vol. 317, no. 6040, pp. 804-806, 1985.
6. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer, "Evolution algorithms in combinatorial optimization," Parallel Computing, vol. 7, no. 1, pp. 65-85, 1988.
7. S. Kobayashi, I. Ono, and M. Yamamura, "An efficient genetic algorithm for job shop scheduling problems," in Proceedings of the 6th International Conference on Genetic Algorithms, 1995, pp. 506-511.
8. T. Uno and M. Yagiura, "Fast algorithms to enumerate all common intervals of two permutations," Algorithmica, vol. 26, no. 2, pp. 290-309, 2000.
9. S. Heber and J. Stoye, "Finding all common intervals of k permutations," in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, ser. CPM '01, 2001, pp. 207-218.
10. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot, "Computing common intervals of k permutations, with applications to modular decomposition of graphs," SIAM Journal on Discrete Mathematics, vol. 22, no. 3, pp. 1022-1039, 2008.
11. G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. Vialette, Combinatorics of Genome Rearrangements. MIT Press, 2009.
12. M. Bernt, A. Braband, M. Middendorf, B. Misof, O. Rota-Stabelli, and P. F. Stadler, "Bioinformatics methods for the comparative analysis of metazoan mitochondrial genome sequences," Molecular Phylogenetics and Evolution, 2012, accepted.
13. T. Stützle and M. Dorigo, "ACO algorithms for the traveling salesman problem," in Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications, K. Miettinen, Ed. John Wiley & Sons, 1999.
14. M. Dorigo and L. Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem," Evolutionary Computation, IEEE Transactions on, vol. 1, no. 1, pp. 53-66, 1997.
15. D. M. Simmons, "One-dimensional space allocation: An ordering algorithm," Operations Research, vol. 17, no. 5, pp. 812-826, 1969.
16. R. Kothari and D. Ghosh, "The single row facility layout problem: state of the art," OPSEARCH, pp. 1-21, 2012.
17. M. Solimanpur, P. Vrat, and R. Shankar, "An ant algorithm for the single row layout problem in flexible manufacturing systems," Comput. Oper. Res., vol. 32, no. 3, pp. 583-598, 2005.
18. C. E. Nugent, T. E. Vollmann, and J. Ruml, "An experimental comparison of techniques for the assignment of facilities to locations," Operations Research, vol. 16, no. 1, pp. 150-173, 1968.