Annals of Operations Research

, Volume 210, Issue 1, pp 101–123

Speed-up Benders decomposition using maximum density cut (MDC) generation

  • Georgios K. D. Saharidis
  • Marianthi G. Ierapetritou
Article
  • 417 Downloads

Abstract

The classical implementation of Benders decomposition in some cases results in low density Benders cuts. Covering Cut Bundle (CCB) generation addresses this issue with a novel way generating a bundle of cuts which could cover more decision variables of the Benders master problem than the classical Benders cut. Our motivation to improve further CCB generation led to a new cut generation strategy. This strategy is referred to as the Maximum Density Cut (MDC) generation strategy. MDC is based on the observation that in some cases CCB generation is computational expensive to cover all decision variables of the master problem than to cover part of them. Thus MDC strategy addresses this issue by generating the cut that involves the rest of the decision variables of the master problem which are not covered in the Benders cut and/or in the CCB. MDC strategy can be applied as a complimentary step to the CCB generation as well as a standalone strategy. In this work the approach is applied to two case studies: the scheduling of crude oil and the scheduling of multi-product, multi-purpose batch plants. In both cases, MDC strategy significant decreases the number of iterations of the Benders decomposition algorithm, leading to improved CPU solution times.

Keywords

Benders decomposition Mixed integer linear programming Multi-generation of cuts Covering cut bundle generation (CCB) Active constraints 

References

  1. Andreas, A. K., & Smith, J. C. (2009). Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network. Networks, 53(2), 91–103. CrossRefGoogle Scholar
  2. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252. CrossRefGoogle Scholar
  3. Cordeau, J. F., Soumis, F., & Desrosiers, J. (2000). A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science, 34(2), 133–149. CrossRefGoogle Scholar
  4. Cordeau, J. F., Pasin, F., & Solomon, M. M. (2006). An integrated model for logistics network design. Annals of Operations Research, 144(1), 59–82. CrossRefGoogle Scholar
  5. Cote, G., & Laughton, M. (1984). Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research, 16, 327–333. CrossRefGoogle Scholar
  6. Freund, R. M., Roundy, R., & Todd, M. J. (1985). Identifying the set of always-active constraints in a system of linear inequalities by a single linear program (Working papers 1674–1985). Massachusetts Institute of Technology (MIT), Sloan School of Management. Google Scholar
  7. Gabrel, V., Knippel, A., & Minoux, M. (1999). Exact solution of multicommodity network optimization problems with general step cost functions. Operations Research Letters, 25, 15–23. CrossRefGoogle Scholar
  8. Hadigheh, A. G., Mirnia, K., & Terlaky, T. (2007). Active constraint set invariancy sensitivity analysis in linear optimization. Journal of Optimization Theory and Applications, 133(3), 303–315. CrossRefGoogle Scholar
  9. Holmberg, K. (1994). On using approximation of the Benders master problem. European Journal of Operational Research, 77, 11–125. CrossRefGoogle Scholar
  10. Ierapetritou, M. G., & Floudas, C. (1998). Effective continuous-time formulation for short-term scheduling: I multipurpose batch processes. Industrial & Engineering Chemistry Research 37(11), 4341–4359. CrossRefGoogle Scholar
  11. Magnanti, T., & Wong, R. (1981). Accelerating Benders decomposition algorithmic enhancement and model selection criteria. Operational Research, 29, 464–484. CrossRefGoogle Scholar
  12. McDaniel, D., & Devine, M. (1977). A modified Benders partitioning algorithm for mixed integer programming. Management Science, 24, 312–319. CrossRefGoogle Scholar
  13. Minoux, M. (1986). Series in discrete mathematics and optimization. Mathematical programming theory and algorithms. New York: Wiley-Interscience. Google Scholar
  14. Minoux, M. (2001). Discrete cost multicommodity network optimization problems and exact solution methods. Annals of Operations Research, 106, 19–46. CrossRefGoogle Scholar
  15. Rei, W., Gendreau, M., Cordeau, J.-F., & Soriano, P. (2006). Accelerating Benders decomposition by local branching. In Hybrid methods and branching rules in combinatorial optimization, Montreal. Google Scholar
  16. Saharidis, G. K. (2006). Pilotage de production a moyen terme et a court terme: contribution aux problématique d’optimisation globale vc locale et a l’ordonnancement dans les raffineries. Genie Industriel. Vol. PhD. Paris: Ecole Centrale Paris. 150. Google Scholar
  17. Saharidis, G. K. D., & Ierapetritou, M. G. (2009a). Resolution method for mixed integer bi-level linear problems based on decomposition technique. Journal of Global Optimization, 44(1), 29–51. CrossRefGoogle Scholar
  18. Saharidis, G. K. D., & Ierapetritou, M. G. (2009b). Scheduling of loading and unloading of crude oil in a refinery with optimal mixture preparation. Industrial & Engineering Chemistry Research, 48(5), 2624–2633. CrossRefGoogle Scholar
  19. Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Computers & Chemical Engineering, 34(8), 1237–1245. CrossRefGoogle Scholar
  20. Saharidis, G. K. D., Boile, M., & Theofanis, S. (2011). Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems. Expert Systems with Applications, 38(6), 6627–6636. CrossRefGoogle Scholar
  21. Saharidis, G. K. D., Minoux, M., & Dallery, Y. (2009). Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. Computers & Chemical Engineering, 33(8), 1413–1426. CrossRefGoogle Scholar
  22. Saharidis, G. K., Minoux, M., & Ierapetritou, M. G. (2010). Accelerating Benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221–237. CrossRefGoogle Scholar
  23. Schittkowski, K. (2009). An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints. Applied Numerical Mathematics 59(12), 2999–3007. CrossRefGoogle Scholar
  24. Van Roy, T. J. (1983). Cross decomposition for mixed integer programming. Mathematical Programming, 25, 46–63. CrossRefGoogle Scholar
  25. Zakeri, G., Philpott, A. B., & Ryan, D. M. (1998). Inexact cuts in Benders decomposition. SIAM Journal on Optimization, 10(3), 643–657. CrossRefGoogle Scholar
  26. Zhu, Y., & Kuno, T. (2003). Global optimization of nonconvex MINLP by a hybrid branch-and-bound and revised general benders decomposition approach. Industrial & Engineering Chemistry Research, 42(3), 528–539. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  • Georgios K. D. Saharidis
    • 1
  • Marianthi G. Ierapetritou
    • 2
  1. 1.Department of Mechanical EngineeringUniversity of ThessalyVolosGreece
  2. 2.Department of Chemical and Biochemical EngineeringRutgers—The State University of New JerseyPiscatawayUSA

Personalised recommendations