Combining local and global search in a constraint programming environment

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.

[1]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[2]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[3]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[4]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[5]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[8]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[9]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[10]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[11]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[12]  Toby Walsh.  Depth-bounded Discrepancy Search , 1997, IJCAI.

[13]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[14]  Philippe Baptiste,et al.  Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem , 1999, J. Heuristics.

[15]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[16]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[17]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[18]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, CP.

[19]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[20]  Guy L. Steele,et al.  The definition and implementation of a computer programming language based on constraints , 1980 .

[21]  François Laburthe,et al.  Heuristics for Large Constrained Vehicle Routing Problems , 1999, J. Heuristics.

[22]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[23]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  François Laburthe,et al.  Solving Small TSPs with Constraints , 1997, ICLP.

[26]  Steven Minton.  Configurable Solvers: Tailoring General Methods to Specific Applications , 1997, CP.

[27]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[28]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[29]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[30]  Eric Taillard,et al.  A NEW NEIGHBORHOOD STRUCTURE FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. , 1995 .

[31]  Michael J. Pazzani,et al.  Relational Clichés: Constraining Induction During Relational Learning , 1991, ML.

[32]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[33]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[34]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[35]  J. Christopher Beck,et al.  Texture-Based Heuristics for Scheduling Revisited , 1997, AAAI/IAAI.

[36]  Claude Le Pape.  Des systèmes d'ordonnancement flexibles et opportunistes , 1988 .

[37]  Amedeo Cesta,et al.  Gaining efficiency and flexibility in the simple temporal problem , 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).

[38]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[39]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[40]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[41]  Philippe Baptiste,et al.  Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case , 1996, ECAI.