Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling

  • André Ciré
  • Elvin Coban
  • John N. Hooker
Conference paper

DOI: 10.1007/978-3-642-38171-3_22

Volume 7874 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ciré A., Coban E., Hooker J.N. (2013) Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling. In: Gomes C., Sellmann M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg

Abstract

A recent paper by Heinz and Beck (CPAIOR 2012) found that mixed integer software has become competitive with or superior to logic-based Benders decomposition for the solution of facility assignment and scheduling problems. Their implementation of Benders differs, however, from that described in the literature they cite and therefore results in much slower performance than previously reported. We find that when correctly implemented, the Benders method remains 2 to 3 orders of magnitude faster than the latest commercial mixed integer software on larger instances, thus reversing the conclusion of the earlier paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • André Ciré
    • 1
  • Elvin Coban
    • 1
  • John N. Hooker
    • 1
  1. 1.Carnegie Mellon UniversityUSA