An ACO-based reactive framework for ant colony optimization: First experiments on constraint satisfaction problems

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

Volumn 5851 LNCS, Issue , 2009, Pages 119-133

  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

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; PARAMETER LEARNING; PARAMETER VALUES; PHEROMONE TRAILS;

OPTIMIZATION; STEELMAKING;

CONSTRAINED OPTIMIZATION;

EID: 72449120435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11169-3_9     Document Type: Conference Paper

References (14)

1. Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
2. Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. Operations research/Computer Science Interfaces. Springer, Heidelberg (2008)
3. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
4. Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence 58, 21-70 (1992)
5. Dorigo, M., Gambardella, L.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53-66 (1997)
6. Stützle, T., Hoos, H.: MAX - MIN Ant System. Journal of Future Generation Computer Systems 16, 889-914 (2000)
7. Solnon, C.: Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization. European Journal of Operational Research (EJOR) 191, 1043-1055 (2008)
8. Solnon, C., Fenet, S.: A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics 12(3), 155-180 (2006)
9. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6(4), 347-357 (2002)
10. Solnon, C., Bridge, D.: An ant colony optimization meta-heuristic for subset selection problems. In: System Engineering using Particle Swarm Optimization, Nova Science, pp. 7-29 (2006)
11. Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satistaction and scheduling problems. Artificial Intelligence 58, 161-205 (1992)
12. van Dongen, M., Lecoutre, C., Roussel, O.: Results of the second csp solver competition. In: Second International CSP Solver Competition, pp. 1-10 (2007)
13. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
14. Randall, M.: Near parameter free ant colony optimisation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 374-381. Springer, Heidelberg (2004)