Skip to main content
SpringerLink
Log in

Constraint programming-based column generation

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

Abstract

This paper surveys recent applications and advances of the constraint programming-based column generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by constraint programming (CP). This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using CP are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the CP-based column generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad hoc networks.

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

  • Achterberg T (2007) Constraint integer programming. PhD thesis, TU Berlin

  • Apt KR (2003) Principles of constraint programming. Cambridge University Press, Cambridge

    Google Scholar 

  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3): 316–329

    Article  Google Scholar 

  • Beldiceanu N, Carlsson M, Rampon JX (2005) Global constraint catalogue. Technical Report SICS-T2005:08, Swedish Institute of Computer Science

  • Capone A, Carello G, Filippini I, Gualandi S, Malucelli F (2009) Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation. Networks (in press)

  • Chu C, Antonio J (1999) Approximation algorithms to solve real-life multicriteria cutting stock problems. Oper Res 47(4): 495–508

    Article  Google Scholar 

  • Ciriani TA, Colombani Y, Heipcke S (2003) Embedding optimisation algorithms with mosel. 4OR 1(2): 155–167

    Article  Google Scholar 

  • Demassey S, Pesant G, Rousseau LM (2006) A cost-regular based hybrid column generation approach. Constraints 11(4): 315–333

    Article  Google Scholar 

  • Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Network routing. Handbooks in operations research and management science, vol 8. Elsevier, pp 35–139

    Google Scholar 

  • DIMACS (2002) Graph coloring instances. http://mat.gsia.cmu.edu/COLOR

  • Easton K, Nemhauser GL, Trick MA (2002) Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Proceedings of practice and theory of automated timetabling. Lecture notes in computer science, vol 2740, pp 100–112. Springer, Berlin

  • Fahle T, Sellmann M (2002) Cost based filtering for the constrained knapsack problem. Ann Oper Res 115(1): 73–93

    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 Heuristics 8(1): 59–81

    Article  Google Scholar 

  • Gabteni S, Grönkvist M (2006) A hybrid column generation and constraint programming optimizer for the tail assignment problem. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 3990, pp 89–103. Springer, Berlin

  • Gecode Team (2006) Gecode: generic constraint development environment. http://www.gecode.org

  • Gendron B, Lebbah H, Pesant G (2005) Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 3524, pp 217–227. Springer, Berlin

  • Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6): 849–859

    Article  Google Scholar 

  • Grönkvist M (2004) A constraint programming model for tail assignment. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 3011, pp 142–156. Springer, Berlin

  • Grönkvist M (2006) Accelerating column generation for aircraft scheduling using constraint propagation. Comput OR 33(10): 2918–2934

    Article  Google Scholar 

  • Gualandi S (2008) Enhancing constraint programming-based column generation for integer programs. PhD thesis, Politecnico di Milano

  • Hansen J, Liden T (2005) Group construction for airline cabin crew: comparing constraint programming with branch and price. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 3524, pp 228–242. Springer, Berlin

  • Harvey WD, Ginsberg ML (1995) Limited discrepancy search. In: Proceedings of international joint conferences on artificial intelligence, pp 607–615

  • Heisig G, Minner S (1999) ILOG OPL studio. OR Spectr 21(4): 419–427

    Article  Google Scholar 

  • Junker U, Karisch SE, Kohl N, Vaaben B, Fahle T, Sellmann M (1999) A framework for constraint programming based column generation. In: Proceedings of principles and practice of constraint programming. Lecture notes in computer science, vol 1713, pp 261–274. Springer, Berlin

  • Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6): 1007–1023

    Article  Google Scholar 

  • Marriott K, Nethercote N, Rafeh R, Stuckey PJ, De La Banda MG, Wallace M. (2008) The design of the Zinc modelling language. Constraints 13(3): 229–267

    Article  Google Scholar 

  • Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York

    Google Scholar 

  • Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. J Comput 8(4): 344–354

    Google Scholar 

  • Michel L, Van Hentenryck P (2003) Comet in context. In: Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge, pp 95–107. ACM, New York

  • Milano M, Wallace M (2006) Integrating operations research in constraint programming. 4OR 4(3): 1–45

    Article  Google Scholar 

  • Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. J Comput 19(1): 36–51

    Google Scholar 

  • Puchinger J, Stuckey PJ, Wallace M, Brand S (2008) From high-level model to branch-and-price solution in G12. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 5015, pp 218–232. Springer, Berlin

  • Ralphs TK, Ladanyi L (2001) COIN/BCP User’s Manual

  • Régin JC (2002) Cost-based arc consistency for global cardinality constraints. Constraints 7(3): 387–405

    Article  Google Scholar 

  • Rossi F, Van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier Science, Amsterdam

    Google Scholar 

  • Rousseau LM (2004) Stabilization issues for constraint programming based column generation. In: Proceedings of integration of AI and OR techniques in CP for combinatorial optimization. Lecture notes in computer science, vol 3011, pp 402–408. Springer, Berlin

  • Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTWs with constraint programming based column generation. Ann Oper Res 130(1): 199–216

    Article  Google Scholar 

  • Rousseau LM, Gendreau M, Feillet D (2007) Interior point stabilization for column generation. Oper Res Lett 35(5): 660–668

    Article  Google Scholar 

  • Sadykov R, Wolsey LA (2006) Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. J Comput 18(2): 209–217

    Google Scholar 

  • Sellmann M, Zervoudakis K, Stamatopoulos P, Fahle T (2002) Crew assignment via constraint programming: integrating column generation and heuristic tree search. Ann Oper Res 115(1): 207–225

    Article  Google Scholar 

  • Wolsey LA (1998) Integer programming. Wiley, New York

    Google Scholar 

  • Yunes TH, Moura AV, de Souza CC (2000) Solving very large crew scheduling problems to optimality. In: Proceedings of ACM symposium on Applied computing, vol 1, pp 446–451. ACM, New York

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Milan, Italy

    Stefano Gualandi & Federico Malucelli

Authors
  1. Stefano Gualandi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Federico Malucelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefano Gualandi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gualandi, S., Malucelli, F. Constraint programming-based column generation. 4OR-Q J Oper Res 7, 113–137 (2009). https://doi.org/10.1007/s10288-009-0101-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-009-0101-4

Keywords

MSC classification (2000)

Search

Navigation