Ant colony optimization for configuration

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2008, Pages 247-254

  Albert, Patrick ^a   Henocque, Laurent ^b   Kleiner, Mathias ^b  

^a IBM   (United States)

^b AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; REINFORCEMENT;

ANT COLONY OPTIMIZATIONS; COMBINATORIAL EXPLOSIONS; DO-MAINS; OPTIMISATION; PARAMETER SETS; PHEROMONE MODELS; RANDOM PROBLEMS; SEARCH ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 57649155537     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2008.144     Document Type: Conference Paper

References (19)

1. J. Amilhastre, H. Fargier, and P. Marquis. Consistency restoration and explanations in dynamic csps application to configuration. Artif. Intell., 135(1-2): 199-234, 2002.
2. R. J. Brachman and J. G. Schmolze. An overview of the kl-one knowledge representation system. Cognitive Science, 9(2): 171-216, 1985.
3. M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Theor. Comput. Sci., 344(2-3):243-278, 2005.
4. M. Dorigo, G. D. Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2): 137-172, 1999.
5. M. Dorigo and L. M. Gambardella. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary Computation, 1(1):53-66, 1997.
6. R. Eberhart and J. Kennedy. A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micromachine and Human Science, pages 39-43, 1995.
7. G. Fleischanderl, G. Friedrich, A. Haselböck, H. Schreiner, and M. Stumptner. Configuring large-scale systems with generative constraint satisfaction. IEEE Intelligent Systems- Special issue on Configuration, 13(7), 1998.
8. L. Henocque, M. Kleiner, and N. Prcovic. Advances in poly-time isomorph elimination for configuration. In proceedings of Principles and Practice of Constraint Programming - CP 2005., pages 301-313, Sitges Barcelona, Spain, 2005. Springer.
9. U. Junker. Configuration. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 13. Elsevier, 2006.
10. U. Junker and D. Mailharro. The logic of ilog (j)configurator: Combining constraint programming with a description logic. In proceedings of Workshop on Configuration, IJCAI'03, 2003.
11. Z. Kiziltan and B. Hnich. Symmetry breaking in a rack configuration problem. In Proc. of the IJCAI'OJ Workshop on Modelling and Solving Problems with Constraints, Seattle, 2001.
12. D. L. McGuinness and J. R. Wright. Conceptual modelling for configuration: A description logic-based approach. AI EDAM, 12(4):333-344, 1998.
13. S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In AAAI, pages 25-32, 1990.
14. D. Sabin and E. Freuder. Configuration as composite constraint satisfaction. Artificial Intelligence and Manufacturing Research Planning Workshop, pages 153-161, 1996.
15. T. Soininen, I. Niemelä, J. Tiihonen, and R. Sulonen. Representing configuration knowledge with weight constraint rules. In Answer Set Programming, 2001.
16. C. Solnon. Ants can solve constraint satisfaction problems. IEEE Trans. Evolutionary Computation, 6(4): 347-357, 2002.
17. M. Stumptner. An overview of knowledge-based configuration. AI Communications, 10(2): 111-125, June 1997.
18. M. Stumptner and A. Haselböck. A generative constraint formalism for configuration problems. In P. Torasso, editor, AI*IA, volume 728 of Lecture Notes in Computer Science, pages 302-313. Springer, 1993.
19. T. Stützle and H. H. Hoos. Max-min ant system. Future Generation Comp. Syst., 16(8):889-914, 2000.