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

  • Authors:

  • Simon de Givry;Laurent Jeannin

  • Affiliations:

  • INRA Unité de Biométrie et Intelligence Artificielle, Chemin de Borde Rouge, Castanet-Tolosan Cedex, France;Thales Research & Technology, Domaine de Corbeville, Orsay Cedex, France

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.