Some Combinatorial Optimization Problems on which Ant Colony Optimization is Invariant
作者： Mauro Birattari , Paulo Pellegrini
DOI:
关键词: Invariant (mathematics) 、 Extremal optimization 、 Computer science 、 Metaheuristic 、 Mathematical optimization 、 Ant colony optimization algorithms 、 Meta-optimization 、 Combinatorial optimization problem 、 Combinatorial optimization
摘要: Ant colony optimization is a well known metaheuristic which has been object of many studies, both theoretic and applicative. In recent analysis [1], particular aspect its behavior investigated. More in detail, the topic interest result achieved by ant algorithms when cost unit instances are expressed changes. Three proved to be invariant this type transformation instances, provided that some conditions satisfied. paper examples combinatorial problems can applied an fashion described. Many typically tackled literature may included list.
ulb.ac.be
pellegrini.it 参考文章(22)
E. G. Coffman, M. R. Garey, D. S. Johnson, Approximation Algorithms for Bin-Packing — An Updated Survey Algorithm Design for Computer System Design. pp. 49- 106 ,(1984) , 10.1007/978-3-7091-4338-4_3
Alberto Caprara, Paolo Toth, Matteo Fischetti, Algorithms for the Set Covering Problem Annals of Operations Research. ,vol. 98, pp. 353- 371 ,(2000) , 10.1023/A:1019225027893
Daniel Serra, Helena Ramalhinho Lourenço, Adaptive search heuristics for the generalized assignment problem soft computing. ,vol. 9, pp. 209- 234 ,(2002)
M. Birattari, T. Stutzle, M. Dorigo, Ant Colony Optimization ,(2004)
Thomas Stützle, Marco Dorigo, ACO algorithms for the quadratic assignment problem New ideas in optimization. pp. 33- 50 ,(1999)
Thomas Stützle, An Ant Approach to the Flow Shop Problem Proceedings of EUFIT'98. pp. 1560- 1564 ,(1998)
The vehicle routing problem Society for Industrial and Applied Mathematics. ,(2001) , 10.1137/1.9780898718515
G. Leguizamon, Z. Michalewicz, A new version of ant system for subset problems congress on evolutionary computation. ,vol. 2, pp. 1459- 1464 ,(1999) , 10.1109/CEC.1999.782655
Christian Blum, Maria J. Blesa, New metaheuristic approaches for the edge-weighted k -cardinality tree problem Computers & Operations Research. ,vol. 32, pp. 1355- 1377 ,(2005) , 10.1016/J.COR.2003.11.007
L.F. Escudero, An inexact algorithm for the sequential ordering problem European Journal of Operational Research. ,vol. 37, pp. 236- 249 ,(1988) , 10.1016/0377-2217(88)90333-5