Strong combination of ant colony optimization with constraint programming optimization

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

Volumn 6140 LNCS, Issue , 2010, Pages 232-245

  Khichane, Madjid ^a,b   Albert, Patrick ^a   Solnon, Christine ^b  

^a IBM   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; REINFORCEMENT LEARNING;

ACO(ANT COLONY OPTIMIZATION); COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINT PROGRAMMING; MAXIMUM INDEPENDENT SETS; PHEROMONE TRAILS; QUADRATIC ASSIGNMENT; REINFORCEMENT LEARNING TECHNIQUES; TWO PHASE ALGORITHM;

ANT COLONY OPTIMIZATION;

EID: 77955444578     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13520-0_26     Document Type: Conference Paper

References (16)

1. Nemhauser, G., Wolsey, A.: Integer and combinatorial optimization. Jhon Wiley & Sons, New York (1988)
2. Papadimitriou, C., Steiglitz, K.: Combinatorial optimization - Algorithms and complexity. Dover, New York (1982)
3. Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671-680 (1983)
4. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
5. Lourenço, H., Martin, O., Stützle, T.: Iterated local search. In: Golver, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research Management Science, vol. 57, pp. 321-353. Kluwer Academic Publisher, Dordrecht (2001)
6. Hensen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voβ, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: advances and trends in local search paradigms for optimization, pp. 433-438. Kluwer Academic Publisher, Dordrecht (1999)
7. Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
8. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
9. Refalo, P.: Impact-based search strategies for constraint programming. In:Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557-571. Springer, Heidelberg (2004)
10. Stützle, T., Hoos, H.: double-struck Mdouble-struck Adouble-struck X - double-struck Mℐscript N Ant System. Journal of Future Generation Computer Systems 16, 889-914 (2000)
11. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6(4), 347-357 (2002)
12. Khichane, M., Albert, P., Solnon, C.: Integration of ACO in a constraint programming language. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 84-95. Springer, Heidelberg (2008)
13. Solnon, C., Fenet, S.: A study of ACO capabilities for solving the Maximum Clique Problem. Journal of Heuristics 12(3), 155-180 (2006)
14. Alaya, I., Solnon, C., Ghedira, K.: Ant Colony Optimization for Multi-objective Optimization Problems. In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 450-457. IEEE Computer Society, Los Alamitos (2007)
15. Birattari, M., Stutzle, T., Paquete, L., Varrentrapp, K.: A Racing Algorithm for Configuring Metaheuristics. In: GECCO, pp. 11-18 (2002)
16. Meyer, B.: Hybrids of constructive meta-heuristics and constraint programming: A case study with ACO. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296. Springer, Heidelberg (2008)