Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carpaneto, G., Dell’Amico, M., Toth, P.: Exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 21, 394–409 (1995)
Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Annals of Operations Research 13, 193–223 (1988)
Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 32–59. Springer, Heidelberg (2001)
Dell’Amico, M., Lodi, A., Martello, S.: Efficient algorithms and codes for k–cardinality assignment problems. Discrete Applied Mathematics 110, 25–40 (2001)
Dell’Amico, M., Martello, S.: Linear assignment. In: Maffioli, F., Dell’Amico, M., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 355–371. Wiley, Chichester (1997)
Dell’Amico, M., Martello, S.: The k-cardinality Assignment Problem. Discrete. Applied Mathematics 76, 103–121 (1997)
El Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5, 359–388 (2000)
Fischetti, M., Toth, P.: An additive bounding procedure for combinatorial optimization problems. Operations Research 37, 319–328 (1989)
Fischetti, M., Toth, P.: An additive bounding procedure for the asymmetric traveling salesman problem. Mathematical Programming 53, 173–197 (1992)
Focacci, F.: Solving combinatorial optimization problems in constraint programming. PhD thesis, University of Ferrara, Italy (2001)
Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189–203. Springer, Heidelberg (1999)
Focacci, F., Lodi, A., Milano, M.: Exploting relaxations in CP. In: Milano, M. (ed.) Constraint and Integer Programming combined. Kluwer, Dordrecht (to appear)
Harvey, W., Ginsberg, M.: Limited discrepancy search. In: Proceedings of the 14th IJCAI, pp. 607–615. Morgan Kaufmann, San Francisco (1995)
Lodi, A., Milano, M.: Discrepancy-based additive bounding. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 17–23. Springer, Heidelberg (2003)
Milano, M., van Hoeve, W.J.: Reduced cost-based ranking for generating promising subproblems. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 1–16. Springer, Heidelberg (2002)
Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. Transportation Science 32, 12–29 (1998)
van Hoeve, W.J., Milano, M.: Decomposition-based search. A theoretical and experimental evaluation. LIA Technical Report LIA00203, University of Bologna (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodi, A., Milano, M., Rousseau, LM. (2003). Discrepancy-Based Additive Bounding for the AllDifferent Constraint. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive