A component language for hybrid solver cooperations

Authors:
Eric Monfroy;Carlos Castro
Affiliations:
LINA, Université de Nantes, France;Universidad Técnica Federico Santa María, Valparaíso, Chile
Venue:
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Year:
2004

Citing 6
Cited 3

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Hybrid Approach for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Basic components for constraint solver cooperations

Proceedings of the 2003 ACM symposium on Applied computing
Principles of Constraint Programming

Principles of Constraint Programming

Cooperation of constraint domains in the TOY system

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp

Theory and Practice of Logic Programming
An approach for dynamic split strategies in constraint solving

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.