We introduce two reactive frameworks for dynamically adapting some parameters of an Ant Colony Optimization (ACO) algorithm. Both reactive frameworks use ACO to adapt parameters: pheromone trails are associated with parameter values; these pheromone trails represent the learnt desirability of using parameter values and are used to dynamically set parameters in a probabilistic way. The two frameworks differ in the granularity of parameter learning. We experimentally evaluate these two frameworks on an ACO algorithm for solving constraint satisfaction problems. © 2009 Springer-Verlag.
CITATION STYLE
Khichane, M., Albert, P., & Solnon, C. (2009). An ACO-based reactive framework for ant colony optimization: First experiments on constraint satisfaction problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5851 LNCS, pp. 119–133). https://doi.org/10.1007/978-3-642-11169-3_9
Mendeley helps you to discover research relevant for your work.