Abstract
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using the CP Optimizer modeling API. Then, it is solved in a generic way by a two-phase algorithm. The first phase aims at creating a hot start for the second: it samples the solution space and applies reinforcement learning techniques as implemented in ACO to create pheromone trails. During the second phase, CP Optimizer performs a complete tree search guided by the pheromone trails previously accumulated. The first experimental results on knapsack, quadratic assignment and maximum independent set problems show that this new algorithm enhances the performance of CP Optimizer alone.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nemhauser, G., Wolsey, A.: Integer and combinatorial optimization. Jhon Wiley & Sons, New York (1988)
Papadimitriou, C., Steiglitz, K.: Combinatorial optimization–Algorithms and complexity. Dover, New York (1982)
Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
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)
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)
Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Stützle, T., Hoos, H.: \(\cal MAX-MIN\) Ant System. Journal of Future Generation Computer Systems 16, 889–914 (2000)
Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6(4), 347–357 (2002)
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)
Solnon, C., Fenet, S.: A study of ACO capabilities for solving the Maximum Clique Problem. Journal of Heuristics 12(3), 155–180 (2006)
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)
Birattari, M., Stutzle, T., Paquete, L., Varrentrapp, K.: A Racing Algorithm for Configuring Metaheuristics. In: GECCO, pp. 11–18 (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khichane, M., Albert, P., Solnon, C. (2010). Strong Combination of Ant Colony Optimization with Constraint Programming Optimization. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-13520-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13519-4
Online ISBN: 978-3-642-13520-0
eBook Packages: Computer ScienceComputer Science (R0)