Designing Hybrid Cooperations with a Component Language for Solving Optimisation Problems
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.
KeywordsLocal Search Constraint Satisfaction Problem Vehicle Route Problem Cooperation Scheme Solve Optimisation Problem
Unable to display preview. Download preview PDF.
- 1.Arbab, F.: Manifold 2.0 Reference Manual. CWI, The Netherlands (May 1997)Google Scholar
- 9.Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 254–365 (1987)Google Scholar
- 10.Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)Google Scholar