Skip to main content
SpringerLink
Log in

Integrating operations research in constraint programming

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

This paper presents constraint programming (CP) as a natural formalism for modelling problems, and as a flexible platform for solving them. CP has a range of techniques for handling constraints including several forms of propagation and tailored algorithms for global constraints. It also allows linear programming to be combined with propagation and novel and varied search techniques which can be easily expressed in CP. The paper describes how CP can be used to exploit linear programming within different kinds of hybrid algorithm. In particular it can enhance techniques such as Lagrangian relaxation, Benders decomposition and column generation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahmed S, Shapiro A (2002) The sample average approximation method for stochastic programs with integer recourse. In: Optimization on line

  • Applegate D, Bixby R, Chvátal V, Cook W (1999) Tsp-solver concorde. http://www.keck.caam. rice.edu/concorde.html

  • Apt KR, Wallace MG (2006) Constraint logic programming using ECLiPSe. Cambridge University Press, Cambridge

    Google Scholar 

  • Arbab F, Monfroy E (1998) Coordination of heterogeneous distributed cooperative constraint solving. Appl Comput Rev 6:4–17 ACM SIGAPP

    Google Scholar 

  • Baptiste P, Le Pape C, Nuijten W (1995) Efficient operations research algorithms in constraint-based scheduling. In: 1st joint workshop on artificial intelligence and operational research

  • Baptiste P, Le Pape C, Nuijten W (2003) Constraint-based scheduling. Kluwer, Dordrecht

    Google Scholar 

  • Beldiceanu N, Bourreau E, Chan P, Rivreau D (1997) Partial search strategy in CHIP. In: Proceedings of the 2nd International conference on meta-heuristics

  • Beldiceanu N, Carlsson M (2002) A new multi-resource cumulatives constraint with negative heights. In: Proceedings of the International Conference on principles and practice of constraint programming CP 2002, vol 2470 of “LNCS”. Springer, Berlin Heidelberg New York, pp 63–79

  • Beldiceanu N, Carlsson M, Rampon J-X (2005) Global constraint catalog. In: SICS Technical Report T2005:08

  • Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238–252

    Article  Google Scholar 

  • Benhamou F, Granvilliers L, Goualard F (1999) Interval constraints: results and perspectives. In: New trends in constraints, pp 1–16

  • Beringer H, De Backer B (1995) Combinatorial problem solving in constraint logic programming with cooperating solvers. In: Beierle C, Plümer L (eds) Logic programming: formal methods and practical applications. North Holland, pp 245–272

  • Bèssiere C, Meseguer P, Freuder E, Larrosa J (2002) On forward checking for non binary constraint satisfaction. Artif Intell 141:205–224

    Article  Google Scholar 

  • Bèssiere C, Régin JC (1997) Arc consistency for general constraint networks: preliminary results. In: Pollack M (ed) Proceedings of the international joint conference on artificial intelligence, IJCAI, Morgan Kaufmann, pp 398–404

  • Bousonville T, Focacci F, Le Pape C, Nuijten E, Paulin F, Puget JF, Robert A, Sadeghin A (2005) Integration of rules and optimization in plant powerops. In: Bartak R, Milano M (eds) Proceedings of the international conference in the integration of AI and OR techniques in constraint programming – CPAIOR 2005, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 1–15

  • Carlier J, Pinson E (1995) An algorithm for solving job shop scheduling. Manage Sci 35:164–176

    Google Scholar 

  • Cheng BMW, Lee JHM, Wu JCK (1996) Speeding up constraint propagation by redundant modeling. In: Freuder EC (ed) Proceedings of the international conference on principles and practice of constraint programming, vol 1118 of “LNCS”. Springer, Berlin Heidelberg New York, pp 91–103

  • Choi CW, Harvey W, Ho-Man Lee J, Stuckey PJ (2004) Finite domain bounds consistency revisited. URL www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cs/0412021Codognet P, Diaz D (1996) Compiling constraints in clp(fd). J Logic Prog 27:1–199

    Google Scholar 

  • Cordier C, Marchand H, Laundy R, Wolsey LA (1999) BC-opt: a branch-and-cut code for mixed integer programs. Math Program 86(2):335–354

    Article  Google Scholar 

  • Crainic TG, Gendreau M, Farvolden JM (2000) A simplex-based tabu search method for capacitated network design. INFORMS J Comput 12(3):223–236

    Article  Google Scholar 

  • Dash Optimization Ltd (2000) Application of optimization with Xpress MP. http://www. dashoptimization.com/home/downloads/book/booka4.pdf

  • Davis E (1987) Constraint propogation with interval labels. Artific Intell 32(3):281–331

    Article  Google Scholar 

  • Demassey S, Pesant G, Rousseau L-M (2005) Constraint programming based column generation for employee timetabling. In: Bartak R, Milano M (eds) Proceedings of the international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems – CPAIOR, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 140–154

  • Deransart P, Hermenegildo MV, Maluszynski J (2000) Analysis and visualisation tools for constraint programming, vol LNCS 1870. Springer, Berlin Heidelberg New York

  • El Sakkout H, Wallace M (2000) Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5(4):359–388

    Article  Google Scholar 

  • Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B (2002) Constraint programming based column generation for crew assignment. J Heurist 8(1):59–81

    Article  Google Scholar 

  • Focacci F, Laburthe F, Lodi A (2003) Local search and constraint programming – ls and cp illustrated on a transportation problem. In: Milano M (ed) Constraint and integer programming – toward a unified methodology, chap 9. Kluwer Dordrecht

  • Focacci F, Lodi A, Milano M (1999) Cost-based domain filtering. In: Jaffar J (ed) Proceedings of the international conference on principles and practice of constraint programming CP’99, vol 1713 of “LNCS”. Springer, Berlin Heidelberg New York, pp 189–203

  • Freuder E, Régin JC (1999) Using constraint metaknowledge to reduce arc-consistency computation. Artific Intell 107:125–148

    Article  Google Scholar 

  • Fruhwirth T (1998) Theory and practice of constraint handling rules. J Logic Program Spec Issue Constraint Logic Program, 37:95–138

    Google Scholar 

  • Gendron B, Lebbah H, Pesant G (2005) Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. In: Bartak R, Milano M (eds) Proceedings of the international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems – CPAIOR, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 217–227

  • Grossmann IE, Jain V (2001) Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS J Comput 13:258–276

    Article  Google Scholar 

  • Harvey WD, Ginsberg ML (1995) Limited discrepancy search. In: Mellish CS (ed) Proceedings of the fourteenth international joint conference on artificial intelligence (IJCAI-95), Vol 1, pp 607–615

  • Hooker JN (2004) A hybrid method for planning and scheduling. In: Wallace M (ed) Proceedings of the international conference on principles and practice of constraint programming – CP 2004, vol 3258 of “LNCS”. Springer, Berlin Heidelberg New York, pp 305–316

  • Hooker JN (2005) Planning and scheduling to minimize tardiness. In: Van Beek P (ed) Proceedings of the international conference on principles and practice of constraint programming – CP 2005, vol 3709 of “LNCS”. Springer, Berlin Heidelberg New York, pp 314–327

  • Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math Program 96:33–60

    Google Scholar 

  • ILOG Optimization Team (2003) Concert technology

  • ILOG Optimization Team (2005) Cplex 10.0 user manual

  • Junger M, Thienel S (2000) The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30:1325–1352

    Article  Google Scholar 

  • Kamarainen O, El Sakkout H (2002) Local probing applied to scheduling. In: Van Hentenryck P (ed) Proceedings of the international conference on principles and practice of constraint programming, vol 2470 of “LNCS”. Springer, Berlin Heidelberg New York, pp 155–171

  • Laburthe F, Caseau Y (2002) Salsa: a language for search algorithms. Constraints 7(3–4):255–288

    Article  Google Scholar 

  • Langley P (1992) Systematic and nonsystematic search strategies. In: Hendler J (ed) Proceedings of the 1st international conference on AI planning systems, AIPS. Morgan Kaufmann pp 145–152

  • Laporte G, Louveaux FV (1993) The integer l-shaped method for stochastic integer programs with complete recourse. Oper Res Lett 13:133–142

    Article  Google Scholar 

  • Laurière JL (1978) A language and a program for stating and solving combinatorial problems. Artif Intell 10:29–127

    Article  Google Scholar 

  • Lemaréchal C (2003) The omnipresence of Lagrange. 4OR 1:7–25

    Article  Google Scholar 

  • Le Provost T, Wallace M (1993) Generalized constraint propagation over the clp scheme. J Logic Program 16:319–359

    Article  Google Scholar 

  • Lin S, Kernighan B (1973) An efficient heuristic for the traveling salesman problem. Oper Res 21(2):498–516

    Google Scholar 

  • Michel L, Van Hentenryck P (2000) Localizer. Constraints 5(1-2):43–84

    Article  Google Scholar 

  • Norkin VI, Pflug GC, Ruszczynski A (1998) A branch and bound method for stochastic global optimization. Math Program 83:407–423

    Google Scholar 

  • Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797–813

    Article  Google Scholar 

  • Ouaja W, Richards B (2005) Hybrid lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. In: Proceedings of 2005 ACM symposium on applied computing, pp 383–387

  • Perron L, Shaw P, Furnon V (2004) Propagation guided large neighborhood search. In: Wallace M (ed) “Proceedings of the international conference on principles and practice of constraint programming CP2004”, vol 3258 of “LNCS”. Springer, Berlin Heidelberg New York, pp 468–481

  • Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heurist 5(3):255–279

    Article  Google Scholar 

  • Refalo P (2000) Linear formulation of constraint programming models and hybrid solvers. In: Dechter R (ed) Proceedings of the international conference on principle and practice of constraint programming – CP 2000, vol 1894 of “LNCS”. Springer, Berlin Heidelberg New York

  • Régin JC (1994) A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth B, Korf R (eds) Proceedings of the national conference on artificial intelligence - AAAI94, pp 362–367

  • Régin JC (1999) Arc consistency for global cardinality constraints with costs. In: Jaffar J (ed) Proceedings of the international conference on principles and practice of constraint programming, CP’99, vol 1713 of “LNCS”. Springer, Berlin Heidelberg New York, pp 390–404

  • Regin JC (2004) Global constraints and filtering algorithms. In: Milano M (ed) Constraint and integer programming. Kluwer Dordrecht

  • Rodosek R, Wallace M, Hajian MT (1999) A new approach to integrating mixed integer programming and constraint logic programming, Recent advances in combinatorial. Ann Oper Res 86:63–87

    Article  Google Scholar 

  • Sannella M, Maloney J, Freeman-Benson B, Borning A (1993) Multi-way versus one-way constraints in user interfaces: experience with the DeltaBlue algorithm. Softw Pract Exp 23(5): 529–566

    Article  Google Scholar 

  • Schulte C, Stuckey PJ (2005) When do bounds and domain propagation lead to the same search space. ACM Trans Program Lang Syst 27(3):388–425

    Article  Google Scholar 

  • Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Proceedings of the international conference on principles and practice of constraint programming CP1998, vol 1520 of “LNCS”. Springer, Berlin Heidelberg New York, pp 417–431

    Chapter  Google Scholar 

  • Moura AV, Yunes TH, de Souza CC (2005) Hybrid column generation approaches for urban transit crew management problems. Transportation Sci 39(2):273–288

    Article  Google Scholar 

  • Tarim A, Manandhar S, Walsh T (2006) Stochastic constraint programming: a scenario-based approach. Constraints 11:53–80

    Article  Google Scholar 

  • Van Hentenryck P (1999) The OPL optimization programming language. MIT Press, Cambridge

    Google Scholar 

  • Van Hentenryck P, Michel L (2005) Constraint-based local search. MIT Press, Cambridge

    Google Scholar 

  • Van Hoeve WJ (2006) The alldifferent constraint: a systematic overview, 2006. URL www.cs.cornell.edu/ vanhoeve/papers/alldiff.pdfWalsh T (2002) Stochastic constraint programming. In: van Harmelen F (ed) Proceedings of the European conference on artificial intelligence, ECAI, IOS Press

  • Zhou NF (2005) Finite-domain constraint propagators in action rules. Theory Pract Logic Program, (to appear)

Download references

Author information

Authors and Affiliations

  1. DEIS University of Bologna, Via Risorgimento, 2, 40136, Bologna, Italy

    Michela Milano

  2. Faculty of Information Technology, Monash University, Clayton, VIC, 3800, Australia

    Mark Wallace

Authors
  1. Michela Milano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michela Milano.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Milano, M., Wallace, M. Integrating operations research in constraint programming. 4OR 4, 175–219 (2006). https://doi.org/10.1007/s10288-006-0019-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-006-0019-z

Keywords

MSC classifications

Search

Navigation