Abstract
Our research is focused on developing hybrid solvers for Combinatorial Optimization Problems. We are concerned with the design of hybrid resolution approaches including Constraint Programming and Metaheuristics. We have been working on that area during the last years, exploring the different issues involved in algorithm design, implementation, tuning and experimental evaluation. We provide an overview of the research we have completed as well as of the future work.
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
References
Castro, C., Moossen, M., Riff, M.C.: A Cooperative Framework Based on Local Search and Constraint Programming for Solving Discrete Global Optimisation. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 93–102. Springer, Heidelberg (2004)
Crawford, B., Castro, C.: Improving the performance of Ant Algorithms using Constraint Programming. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 31–36. Springer, Heidelberg (2006)
Crawford, B., Castro, C.: Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 1082–1090. Springer, Heidelberg (2006)
Crawford, B., Castro, C., Monfroy, E.: A constructive Hybrid Algorithm for Crew Pairing Optimization. In: Euzenat, J., Domingue, J. (eds.) AIMSA 2006. LNCS (LNAI), vol. 4183, pp. 45–55. Springer, Heidelberg (2006)
Focacci, F., Laburthe, F., Lodi, A.: Local Search and Constraint Programming. In: Handbook of metaheuristics, Kluwer Academic Publishers, Dordrecht (2002)
Meyer, B., Ernst, A.: Integrating ACO and Constraint Propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 166–177. Springer, Heidelberg (2004)
Monfroy, E., Castro, C., Crawford, B.: Adaptive enumeration strategies and metabacktracks for constraint solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol. 4243, pp. 354–363. Springer, Heidelberg (2006)
Monfroy, E., Castro, C., Crawford, B.: Using local search for guiding enumeration in constraint solving. In: Euzenat, J., Domingue, J. (eds.) AIMSA 2006. LNCS (LNAI), vol. 4183, pp. 56–65. Springer, Heidelberg (2006)
Monfroy, E., Saubion, F., Lambert, T.: Hybrid CSP Solving. In: Gramlich, B. (ed.) Frontiers of Combining Systems. LNCS (LNAI), vol. 3717, pp. 138–167. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crawford, B., Castro, C., Monfroy, E. (2007). Integration of Constraint Programming and Metaheuristics. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-73580-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73579-3
Online ISBN: 978-3-540-73580-9
eBook Packages: Computer ScienceComputer Science (R0)