Higher order pheromone models in ant colony optimisation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4150 LNCS, Issue , 2006, Pages 428-435

  Montgomery, James ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; METADATA; PROBLEM SOLVING;

ANT COLONY OPTIMIZATION; PHEROMONE; PHEROMONE MODELS; PROBLEM SPECIFIC COMPONENTS;

GLOBAL OPTIMIZATION;

EID: 33751368308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839088_42     Document Type: Conference Paper

References (15)

1. Zlochin, M., Dorigo, M.: Model-based search for combinatorial optimization: A comparative study. In: 7th International Conference on Parallel Problem Solving from Nature. (2002) 651-662
2. Montgomery, J., Randall, M., Hendtlass, T.: Automated selection of appropriate pheromone representations in ant colony optimisation. Artificial Life 11 (2005) 269-291
3. Blum, C.: Theoretical and practical aspects of ant colony optimization. Volume 282 of Dissertations in Artificial Intelligence. IOS Press, Nieuwe Hemweg, The Netherlands (2004)
4. Blum, C., Sampels, M.: Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In: 2002 Congress on Evolutionary Computation. (2002) 1558-1563
5. Montgomery, E.J.: Solution Biases and Pheromone Representation Selection in Ant Colony Optimisation. PhD thesis, Bond University (2005)
6. Stützle, T., Hoos, H.: MAX - MIN ant system. Future Gen. Comp. Sys. 16 (2000) 889-914
7. Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. In: 4th Metaheuristics International Conference, Porto, Portugal (2001) 187-192
8. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Trans. Evol. Comput. 6 (2002)
9. Fenet, S., Solnon, C.: Searching for maximum cliques with ant colony optimization. In Raidi, G., et al., eds.: EvoWorkshops 2003. Volume 2611 of LNCS. Springer-Verlag (2003) 236-245
10. Blum, C.: Ant colony optimization for the edge-weighted k-cardinality tree problem. In Langdon, W., ed.: Genetic and Evolutionary Computation Conference, Morgan Kaufmann Publishers (2002) 27-34
11. Costa, D., Hertz, A.: Ants can colour graphs. J. Oper. Res. Soc. 48 (1997) 295-305
12. Schoofs, L., Naudts, B.: Solving CSPs with ant colonies. In: Abstract Proceedings of ANTS2000, Brussels, Belgium (2000)
13. Ducatelle, F., Levine, J.: Ant colony optimisation and local search for bin packing and cutting stock problems. J. Oper. Res. Soc. 55 (2004) 705-716
14. 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., eds.: Ant Algorithms. Volume 2463 of LNCS, Springer-Verlag (2002) 1-13
15. Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. J. Math. Model. Algorithms 3 (2004) 285-308