Which dynamic constraint problems can be solved by ants?

FLAIRS 2006 - Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference

Volumn 2006, Issue , 2006, Pages 439-444

  Mertens, Koenraad ^a   Holvoet, Tom ^a   Berbers, Yolande ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; METADATA; OPTIMIZATION; PROBLEM SOLVING;

ANT COLONY OPTIMIZATION (ACO); DYNAMIC CONSTRAINT PROBLEMS; HETEROGENEOUS PROBLEMS; META-HEURISTIC;

CONSTRAINT THEORY;

EID: 33746054542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Craenen, B. G. W.; Eiben, A. E.; and van Hemert, J. I. 2003. Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Trans. Evolutionary Computation 7(5):424-444.
2. Davenport, A. 1995. A comparison of complete and incomplete algorithms in the easy and hard regions. In Proceedings of the Workshop on Studying and Solving Really Hard Problems, CP-95, 43-51.
3. Dechter, R., and Dechter, A. 1988. Belief maintenance in dynamic constraint networks. In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI '88), 37-42.
4. Dechter, R. 1990. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell. 41(3):273-312.
5. Dorigo, M.; Maniezzo, V.; and Colorni, A. 1991. Positive Feedback as a Search Strategy, Technical Report 91016, Dipartimento di Elettronica e Informatica, Politecnico di Milano, Italy.
6. Engineering, T. http://www.engineering.tractebel.com/.
7. Guntsch, M.; Middendorf, M.; and Schmeck, H. 2001. An ant colony optimization approach to dynamic TSP. In Spector, L.; Goodman, E. D.; Wu, A.; Langdon, W. B.; Voigt, H.-M.; Gen, M.; Sen, S.; Dorigo, M.; Pezeshk, S.; Garzon, M. H.; and Burke, E., eds., Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 860-867. San Francisco, California, USA: Morgan Kaufmann.
8. Mailler, R. 2005. Comparing two approaches to dynamic, distributed constraint satisfaction. In Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '05), 1049-1056.
9. Mertens, K., and Holvoet, T. 2004. CSAA; a Constraint Satisfaction Ant Algorithm Framework. In Proceedings of the Sixth International Conference on Adaptive Computing in Design and Manufacture (ACDM'04), 285-294. Springer-Verlag.
10. Morris, P. 1993. The breakout method for escaping from local minima. In AAAI, 40-45.
11. Schiex, T., and Verfaillie, G. 1993. Two approaches to the solution maintenance problem in dynamic constraint satisfaction problems. In Proceedings of the IJCAI-93/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control, Chambery, France.
12. van Hemert, J., and Solnon, C. 2004. A study into ant colony optimization, evolutionary computation and constraint programming on binary constraint satisfaction problems. In Applications of evolutionary computing (EvoCOP 2004), Lecture Notes in Computer Science. Springer Verlag.
13. van Hemert, J. I., and Urquhart, N. 2004. Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation. In Yao, X.; Burke, E. K.; Lozano, J. A.; Smith, J.; Guervós, J. J. M.; Bullinaria, J. A.; Rowe, J. E.; Tiño, P.; Kabán, A.; and Schwefel, H.-P., eds., Parallel Problem Solving from Nature - PPSN VIII, 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings, volume 3242 of Lecture Notes in Computer Science, 151-160. Springer.