A unified framework for partial and hybrid search methods in constraint programming - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2006

A unified framework for partial and hybrid search methods in constraint programming

Résumé

We present a library called ToOLS for the design of complex tree search algorithms in constraint programming (CP). We separate the description of a search algorithm into three parts: a refinement-based search scheme that defines a complete search tree, a set of conditions for visiting nodes that specifies a parameterized partial exploration, and a strategy for combining several partial explorations. This library allows the expression of most of the partial, i.e. nonsystematic backtracking, search methods, and also a specific class of hybrid local/global search methods called large neighborhood search, which are very naturally suited to CP. Variants of these methods are easy to implement with the ToOLS primitives. We demonstrate the expressiveness and efficiency of the library by solving a satellite mission management benchmark that is a mix between a traveling salesman problem with time windows and a Knapsack problem. Several partial and hybrid search methods are compared. Our results dramatically outperform CP approaches based on classical depth-first search methods.
Fichier principal
Vignette du fichier
A unified framework for partial and hybrid search methods in constraint programming_1.pdf (8.21 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-02659665 , version 1 (30-05-2020)

Identifiants

Citer

Simon de Givry, Laurent Jeannin. A unified framework for partial and hybrid search methods in constraint programming. Computers and Operations Research, 2006, 33 (10), pp.2805-2833. ⟨10.1016/j.cor.2005.01.012⟩. ⟨hal-02659665⟩
16 Consultations
51 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More