When ants attack: Ant algorithms for constraint satisfaction problems

Artificial Intelligence Review

Volumn 24, Issue 3-4, 2005, Pages 455-476

  Tarrant, Finbarr ^a   Bridge, Derek ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Ant algorithms; Constraint satisfaction problems

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

ANT ALGORITHMS; CONSTRAINT SATISFACTION PROBLEMS; DEPOSIT PHEROMONE; EVOLUTIONARY COMPUTATIONS;

CONSTRAINT THEORY;

EID: 29144509560     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10462-005-9005-7     Document Type: Conference Paper

References (15)

1. Achlioptas, D., Gomes, C. P., Kautz, H. A. & Selman, B. (2000). Generating Satisfiable Problem Instances. In Proceedings of AAAI, 256-261.
2. Achlioptas, D., Kirousis, L. M., Kranakis, E., Krizanc, D., Molloy, M. & Stamatiou, Y. (2001). Random Constraint Satisfaction: A More Accurate Picture. Constraints 6(4): 329-344.
3. Bullnheimer, B., Hartl, R. & Strauss, C. (1998). Applying the Ant System to the Vehicle Routing Problem. In I. Osman, S. Voss, S. Martello & C. Roucairol (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization Kluwer 109-120.
4. Clark, D. A., Frank, J., Gent, I. P., MacIntyre, E., Tomov, N. & Walsh, T. (1996). Local Search and the Number of Solutions. In E. C. Freuder (ed.) Principles and Practice of Constraint Programming (Proceedings of CP'96), 119-133. LNCS 1118. Springer.
5. Dorigo, M., Caro, G. D. & Gambardella, L. M. (1999). Ant Algorithms for Discrete Optimization. Artificial Life 5(2): 137-172.
6. Dorigo, M., Maniezzo, V. & Colorni, A. (1996). The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1): 1-13.
7. Gent, I. P., MacIntyre, E., Prosser, P., Smith, B. M. & Walsh, T. (2001). Random Constraint Satisfaction: Flaws and Structure. Journal of Constraints 6(4): 345-372.
8. Gent, I. P., Maclntyre, E., Prosser, P., & Walsh, T. (1996). The Constrainedness of Search. In Proceedings of 13th AAAI, 246-252.
9. Mertens, K., Steegmans, E. & Holvoet, T. (2002). Cyclic Path-Based Environment: an Ant Environment for Solving Distributed Constraint Satisfaction Problems. In M. Yokoo (ed.) Proceedings of the 3rd International Workshop on Distributed Constraint Reasoning, 94-103.
10. Roli, A., Blum, C. & Dorigo, M. (2001). ACO for Maximal Constraint Satisfaction Problems. In Proceedings of the 4th Metaheuristics International Conference, 187-191.
11. Schoofs, L. & Naudts, B. (2000). Ant Colonies are Good at Solving Constraint Satisfaction Problems. In Proceedings of the 2000 Congress on Evolutionary Computation, Vol. 2, 1190-1195.
12. Smith, B. M. & Dyer, M. E. (1996). Locating the Phase Transitions in Binary Constraint Satisfaction Problems. Artificial Intelligence 18(1-2): 155-181.
13. Solnon, C. (2002). Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation 6(4): 347-357.
14. Stützle, T. & Hoos, H. (1998). Improvements on the Ant System: Introducing the MAX-MIN Ant System. In G Smith, N. Steele & R. Albrecht (eds.) Proceedings of Artificial Neural Nets and Genetic Algorithms 1997, Springer, 245-249.
15. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.