Abstract
In this paper, we use a simple component language to design solver cooperations for solving constrained optimisation problems. The cooperations we consider are hybrid: they use both complete and incomplete methods in order to take advantage of their respective assets. Our language enables us to carry out some more exotic cooperations than the usual “algorithmic” ones. We present some experimental results that show the benefits of such hybrid cooperations in terms of efficiency.
The authors have been partially supported by the Franco-Chilean INRIA-CONICYT project Cocars.
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
Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)
Arbab, F.: Manifold 2.0 Reference Manual. CWI, The Netherlands (May 1997)
Castro, C., Monfroy, E., Ringeissen, C.: A Rule Language for Interaction. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, pp. 154–170. Springer, Heidelberg (2004)
Habet, D., Li, C.-M., Devendeville, L., Vasquez, M.: A hybrid approach for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 172. Springer, Heidelberg (2002)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence (2002)
Monfroy, E., Castro, C.: Basic Components for Constraint Solver Cooperations. In: Proc. of ACM SAC 2003, ACM Press, New York (2003)
Monfroy, E., Saubion, F., Lambert, T.: On hybridization of local search and constraint propagation. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 299–313. Springer, Heidelberg (2004)
Papadopoulos, G.A., Arbab, F.: Coordination models and languages. In: Advances in Computers – The Engineering of Large Systems, vol. 46, pp. 329–400. Academic Press, London (1998)
Pesant, G., Gendreau, M.: A view of local search in constraint programming. In: Proc. of CP 1996, vol. 1118, Springer, Heidelberg (1996)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 417. Springer, Heidelberg (1998)
Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 254–365 (1987)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monfroy, E., Castro, C. (2004). A Component Language for Hybrid Solver Cooperations. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2004. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30198-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30198-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23478-4
Online ISBN: 978-3-540-30198-1
eBook Packages: Computer ScienceComputer Science (R0)