Accelerating Benders method using covering cut bundle generation

Georgios K.D. Saharidis, Michel Minoux, Marianthi G. Ierapetritou

Research output: Contribution to journalArticle

65 Scopus citations

Abstract

Over the years, various techniques have been proposed to speed up the classical Benders decomposition algorithm. The work presented in the literature has focused mainly on either reducing the number of iterations of the algorithm or on restricting the solution space of the decomposed problems. In this article, a new strategy for Benders algorithm is proposed and applied to two case studies in order to evaluate its efficiency. This strategy, referred to as covering cut bundle (CCB) generation, is shown to implement in a novel way the multiple constraints generation idea. The CCB generation is applied to mixed integer problems arising from two types of applications: the scheduling of crude oil and the scheduling problem for multi-product, multi-purpose batch plants. In both cases, CCB significantly decreases the number of iterations of the Benders method, leading to improved resolution times.

Original languageEnglish (US)
Pages (from-to)221-237
Number of pages17
JournalInternational Transactions in Operational Research
Volume17
Issue number2
DOIs
StatePublished - Mar 2010

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation

Keywords

  • Benders decomposition
  • Covering cut bundle
  • Mixed integer programming
  • Multi-generation of cuts

Cite this