Discrepancy-Based Additive Bounding for the AllDifferent Constraint

In this paper we show how to exploit in Constraint Programming (CP) a well-known integer programming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search strategy based on the concept of discrepancy, i.e., a branching decision which does not follow the suggestion of a given heuristic. The property of a node to have an associated discrepancy k can be modeled (and enforced) through a constraint, called k-discrepancy constraint. Our key result is the exploitation of the k-discrepancy constraint to improve the bound given by any relaxation of a combinatorial optimization problem by using the additive bounding idea. We believe that this simple idea can be effectively exploited to tighten relaxations in CP solvers and speed up the proof of optimality. The general use of additive bounding in conjunction with LDS has been presented in [14]. Here we focus on a particular case where the AllDifferent constraint is part of the CP model. In this case, the integration of additive bound in CP is particularly effective.

[1]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[2]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

[3]  Willem Jan van Hoeve,et al.  Reduced Cost-Based Ranking for Generating Promising Subproblems , 2002, CP.

[4]  Mauro Dell'Amico,et al.  The k-cardinality Assignment Problem , 1997, Discret. Appl. Math..

[5]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[6]  Matteo Fischetti,et al.  An Additive Bounding Procedure for Combinatorial Optimization Problems , 1989, Oper. Res..

[7]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

[8]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[9]  Joxan Jaffar,et al.  Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[10]  Paolo Toth,et al.  Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[11]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

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

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

[14]  Willem Jan van Hoeve,et al.  Decomposition Based Search - A theoretical and experimental evaluation , 2004, ArXiv.

[15]  Mauro Dell'Amico,et al.  Efficient algorithms and codes for k-cardinality assignment problems , 2001, Discret. Appl. Math..

[16]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[17]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.