Abstract
Constraint propagation is aimed at removing from variable domains combinations of values which cannot appear in any consistent solution. Pruning derives from feasibility reasoning. When coping with optimization problems, pruning can be performed also on the basis of costs, i.e., optimality reasoning. Propagation can be aimed at removing combination of values which cannot lead to solutions whose cost is better then the best one found so far. For this purpose, we embed in global constraints optimization components representing suitable relaxations of the constraint itself. These components provide efficient Operations Research algorithms computing the optimal solution of the relaxed problem and a gradient function representing the estimated cost of each variable-value assignment. We exploit these pieces of information for pruning and for guiding the search. We have applied these techniques to a couple of ILOG Solver global constraints (a constraint of difference and a path constraint) and tested the approach on a variety of combinatorial optimization problems such as Timetabling, Travelling Salesman Problems and Scheduling Problems with setup. Comparisons with pure Constraint Programming approaches and related literature clearly show the benefits of the proposed approach. By using cost-based filtering in global constraints, we can optimally solve problems that are one order of magnitude greater than those solved by pure CP approaches, and we outperform other hybrid approaches integrating OR techniques in Constraint Programming.
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
Baptiste, P., Le Pape, C., Nuijten, W.: Efficient operations research algorithms in constraint-based scheduling. In: Proceedings of IJCAI (1995)
Beringer, H., De Backer, B.: Combinatorial problem solving in Constraint Logic Programming with Cooperating Solvers. In: Beierle, C., Plumer, L. (eds.) Logic Programming: formal Methods and Practical Applications. North Holland, Amsterdam (1995)
Bockmayr, A., Kasper, T.: Branch-and-Infer: A unifying framework for Integer and Finite Domain Constraint Programming. INFORMS J. Computing 10(3), 287–300 (1998)
Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the Assignment Problem. In: Simeone, B., et al. (eds.) Fortran Codes for Network Optimization - Annals of Operations Research, pp. 193–223 (1988)
Caseau, Y., Laburthe, F.: Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 129–149. Springer, Heidelberg (1996)
Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: Proceedings of the Fourteenth International Conference on Logic Programming - ICLP 1997, pp. 316–330 (1997)
Caseau, Y., Laburthe, F.: Solving various weighted matching problems with constraints. In: Proceedings of CP 1997 (1997)
Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton (1963)
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)
Fischetti, M., Toth, P.: An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming 53, 173–197 (1992)
Focacci, F., Lodi, A., Milano, M.: Integration of CP and OR methods for Matching Problems. In: CP-AI-OR 1999 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (1999)
Focacci, F., Lodi, A., Milano, M.: Solving tsp with time windows with constraints. In: ICLP 1999 International Conference on Logic Programming (1999)
Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving TSP through the integration of OR and CP techniques. In: Proc. CP 1998 Workshop on Large Scale Combinatorial Optimisation and Constraints (1998)
Jünger, M., Reinelt, G., Rinaldi, G.: The Travelling Salesman Problem. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester (1997)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley and Sons, Chichester (1988)
Pesant, G., Gendreau, M., Potvin, J.Y., Rousseau, J.M.: An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science 32(1), 12–29 (1998)
Pesant, G., Gendreau, M., Potvin, J.Y., Rousseau, J.M.: On the flexibility of Constraint Programming models: From Single to Multiple Time Windows for the Travelling Salesman Problem. European Journal of Operational Research 117(2), 253–263 (1999)
Puget, J. F.: A C++ implementation of CLP. Technical Report 94-01, ILOG Headquarters (1994)
Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994 (1994)
Reinelt, G.: TSPLIB - a Travelling Salesman Problem Library. ORSA Journal on Computing 3, 376–384 (1991)
Rodosek, R., Wallace, M., Hajian, M.T.: A new approach to integrating Mixed Integer Programming and Constraint Logic Programming. Annals of Operational Research, Recent Advances in Combinatorial Optimization (1997)
Simonis, H.: Calculating lower bounds on a resource scheduling problem. Technical report, Cosytec (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Focacci, F., Lodi, A., Milano, M. (1999). Cost-Based Domain Filtering. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive