Solution bias in ant colony optimisation: Lessons for selecting pheromone models

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 2728-2749

  Montgomery, James ^a   Randall, Marcus ^b   Hendtlass, Tim ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b BOND UNIVERSITY   (Australia)

Author keywords

Ant colony optimisation; Constructive metaheuristic; Pheromone model; Solution bias

Indexed keywords

ANALOG COMPUTERS; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

CONSTRUCTIVE METAHEURISTICS; PHEROMONE MODELS; SOLUTION CONSTRUCTION;

COMBINATORIAL OPTIMIZATION;

EID: 38749091758     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.014     Document Type: Article

References (31)

1. Zlochin M., and Dorigo M. Model-based search for combinatorial optimization: a comparative study. Proceedings of the seventh international conference on parallel problem solving from nature (PPSN2002) (2002) 651-662
2. Blum C., and Sampels M. Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. Proceedings of the 2002 congress on evolutionary computation (2002) 1558-1563
3. Dorigo M., and Stützle T. The ant colony optimisation metaheuristic: algorithms, applications and advances. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2002), Kluwer Academic Publishers, Boston, MA 251-285
4. Blum C., and Dorigo M. Search bias in ant colony optimization: on the role of competition-balanced systems. IEEE Transactions on Evolutionary Computation 9 2 (2005) 159-174
5. Blum C, Sampels M. When model bias is stronger than selection pressure. In: Merelo-Guervós JJ, et al., editors. Proceedings of the seventh international conference on parallel problem solving from nature (PPSN2002). Granada, Spain; 2002. p. 893-902.
6. Merkle D., and Middendorf M. Modelling the dynamics of ant colony optimization algorithms. Evolutionary Computation 10 3 (2002) 235-262
7. Montgomery EJ. Solution biases and pheromone representation selection in ant colony optimisation. Ph.D. thesis, Bond University, 2005.
8. Montgomery J, Randall M, Hendtlass T. Search bias in constructive metaheuristics and implications for ant colony optimisation. In: Dorigo M, et al., editors. Proceedings of the fourth international workshop on ant colony optimization and swarm intelligence, ANTS 2004, Brussels, Belgium; 2004. p. 390-7.
9. Montgomery J, Randall M, Hendtlass T. Structural advantages for ant colony optimisation inherent in permutation scheduling problems. In: Ali M, Esposito F, editors. Proceedings of the 18th international conference on industrial and engineering applications of artificial intelligence and expert systems (IEA/AIE 2005). Bari, Italy; 2005. p. 218-28.
10. Montgomery J., Randall M., and Hendtlass T. Automated selection of appropriate pheromone representations in ant colony optimisation. Artificial Life 11 3 (2005) 269-291
11. Stützle T., and Dorigo M. ACO algorithms for the traveling salesman problem. In: Miettinen K., et al. (Ed). Evolutionary algorithms in engineering and computer science (1999), Wiley, New York 163-183
12. Blum C., and Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B 34 2 (2003) 1161-1172
13. Blum C. Theoretical and practical aspects of ant colony optimization. Dissertations in artificial intelligence vol. 282 (2004), IOS Press, Nieuwe Hemweg, The Netherlands
14. Birattari M, Di Caro G, Dorigo M. Toward the formal foundation of ant programming. In: Dorigo M, Di Caro G, Sampels M, editors. Proceedings of the third international workshop on ant algorithms, ANTS 2002, Brussels, Belgium; 2002. p. 188-201.
15. Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing 11 4 (1999) 358-369
16. Maniezzo V, Milandri M. An ant-based framework for very strongly constrained problems. In: Dorigo M, Di Caro G, Sampels M, editors. Proceedings of the third international workshop on ant algorithms, ANTS2002, Brussels, Belgium; 2002. p. 222-7.
17. Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. JORBEL 34 1 (1994) 39-53
18. Blum C., and Sampels M. An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms 3 3 (2004) 285-308
19. Beasley JE. OR-Library, 〈http://people.brunel.ac.uk/∼mastjjb/jeb/info.html〉, 2005.
20. Roli A, Blum C, Dorigo M. ACO for maximal constraint satisfaction problems. In: Proceedings of the fourth metaheuristics international conference. Porto, Portugal; 2001. p. 187-92.
21. Socha K, Knowles J, Sampels M. A MAX-MIN ant system for the university course timetabling problem. In: Dorigo M, Di Caro G, Sampels M, editors. Proceedings of the third international workshop on ant algorithms, ANTS 2002, Brussels, Belgium; 2002. p. 1-13.
22. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
23. Stützle T., and Hoos H. The MAX-MIN ant system and local search for combinatorial optimization problems: towards adaptive tools for combinatorial global optimization. In: Voss S., et al. (Ed). Meta-heuristics: advances and trends in local search paradigms for optimization (1998), Kluwer Academic Publishers, Boston, MA 313-329
24. Bertsekas D.P. Nonlinear programming. 2nd ed (1999), Athena Scientific, Belmont, MA
25. Meuleau N., and Dorigo M. Ant colony optimization and stochastic gradient descent. Artificial Life 8 2 (2002) 103-121
26. Smith K., Palaniswami M., and Krishnamoorthy M. A hybrid neural network approach to combinatorial optimisation. Computers and Operations Research 73 (1996) 501-508
27. Reinelt G. TSPlib-a traveling salesman problem library, 〈 http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/〉, 2004.
28. Burkard RE, Çela E, Karisch SE, Rendl F. QAPLIB-a quadratic assignment problem library, 〈 http://www.seas.upenn.edu/qaplib/〉, 2005.
29. Randall M. Heuristics for ant colony optimisation using the generalised assignment problem. In: Proceedings of the 2004 congress on evolutionary computing. Portland, OR, USA; 2004. p. 1916-23.
30. Gottlieb J, Puchta M, Solnon C. A study of greedy, local search, and ant colony optimization approaches to car sequencing problems. In: Raidl G, et al., editors. Proceedings of the evoworkshops 2003. Essex, UK; 2003. p. 246-57.
31. Montgomery J. Higher order pheromone models in ant colony optimisation. In: Dorigo M, et al., editors. Proceedings of the fifth international workshop on ant colony optimization and swarm intelligence, ANTS 2006, Brussels, Belgium; 2006. p. 428-35.