Abstract
In this paper, we use a simple asynchronous coordination language to design some complex hybrid cooperation schemes for solving optimisation problems. The language allows us to specify the interaction between complete and incomplete constraint solvers in a clear and uniform way. Experimental results 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.
Chapter PDF
References
Arbab, F.: Manifold 2.0 Reference Manual. CWI, The Netherlands (May 1997)
Bockmayr, A., Kasper, T.: Branch-and-Infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Computing 10(3), 287–300 (1998)
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)
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) (to appear)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence 139, 21–45 (2002)
Mackworth, A.: Consistency in Networks of Relations. AI Journal 8, 99–118 (1977)
Monfroy, E., Castro, C.: A Component Language for Hybrid Solver Cooperations. In: Yakhno, T. (ed.) ADVIS 2004. LNCS, vol. 3261, pp. 192–202. Springer, Heidelberg (2004) (to appear)
Prestwich, S.: Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research 115, 51–72 (2002)
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)
Zahn, M., Hower, W.: Backtracking along with constraint processing and their time complexities. J. of Exp. and Theor. AI 8, 63–74 (1996)
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
Castro, C., Monfroy, E. (2004). Designing Hybrid Cooperations with a Component Language for Solving Optimisation Problems. In: Bussler, C., Fensel, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2004. Lecture Notes in Computer Science(), vol 3192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30106-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-30106-6_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22959-9
Online ISBN: 978-3-540-30106-6
eBook Packages: Springer Book Archive