Hostname: page-component-7c8c6479df-8mjnm Total loading time: 0 Render date: 2024-03-28T08:37:45.579Z Has data issue: false hasContentIssue false

Combining local and global search in a constraint programming environment

Published online by Cambridge University Press:  24 August 2001

YVES CASEAU
Affiliation:
Bouygues SA, DTN, 1, avenue Eugène Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr
FRANÇOIS LABURTHE
Affiliation:
Bouygues SA, DTN, 1, avenue Eugène Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr
CLAUDE LE PAPE
Affiliation:
Bouygues Telecom, R&D, 51, avenue de l'Europe, F-78944 Vélizy, Franceclepapeg@bouyguestelecom.fr
BENOÎT ROTTEMBOURG
Affiliation:
Bouygues SA, DTN, 1, avenue Eugène Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr

Abstract

This paper presents several case studies which illustrate how constraint programming can benefit from the combination of global and local search techniques, offering a flexible and efficient platform for the design of combinatorial optimisation applications. For job-shop scheduling, we relate experiments with local search procedures that use global search to intensively explore a given neighbourhood, in the spirit of “shuffle” methods. For preemptive job-shop scheduling, two basic search strategies, Depth-First Search and Limited Discrepancy Search, are compared. For Vehicle Routing we report an Incremental Local Optimisation heuristic, combined with Limited Discrepancy Search. Finally, we show how ad hoc algebras can considerably enhance the design of heuristics based on local and global search within a constraint-programming environment. Experiments on vehicle routing will enlighten how such a language for “search and insert” control can enable automated tuning and discovery of new strategies adapted to the instances typology of the problem at stake.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)