Accelerating Benders method using covering cut bundle generation

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

Research output: Contribution to journalArticle

62 Citations (Scopus)

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 - Jan 1 2010

Fingerprint

Scheduling
Crude oil
Decomposition
Batch
Idea generation
Benders decomposition
Integer

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

Saharidis, Georgios K.D. ; Minoux, Michel ; Ierapetritou, Marianthi. / Accelerating Benders method using covering cut bundle generation. In: International Transactions in Operational Research. 2010 ; Vol. 17, No. 2. pp. 221-237.
@article{6990c277981a4ff4aaa1bf66ecdd6c2f,
title = "Accelerating Benders method using covering cut bundle generation",
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.",
keywords = "Benders decomposition, Covering cut bundle, Mixed integer programming, Multi-generation of cuts",
author = "Saharidis, {Georgios K.D.} and Michel Minoux and Marianthi Ierapetritou",
year = "2010",
month = "1",
day = "1",
doi = "10.1111/j.1475-3995.2009.00706.x",
language = "English (US)",
volume = "17",
pages = "221--237",
journal = "International Transactions in Operational Research",
issn = "0969-6016",
publisher = "Blackwell Publishing",
number = "2",

}

Accelerating Benders method using covering cut bundle generation. / Saharidis, Georgios K.D.; Minoux, Michel; Ierapetritou, Marianthi.

In: International Transactions in Operational Research, Vol. 17, No. 2, 01.01.2010, p. 221-237.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Accelerating Benders method using covering cut bundle generation

AU - Saharidis, Georgios K.D.

AU - Minoux, Michel

AU - Ierapetritou, Marianthi

PY - 2010/1/1

Y1 - 2010/1/1

N2 - 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.

AB - 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.

KW - Benders decomposition

KW - Covering cut bundle

KW - Mixed integer programming

KW - Multi-generation of cuts

UR - http://www.scopus.com/inward/record.url?scp=85040409511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040409511&partnerID=8YFLogxK

U2 - 10.1111/j.1475-3995.2009.00706.x

DO - 10.1111/j.1475-3995.2009.00706.x

M3 - Article

AN - SCOPUS:85040409511

VL - 17

SP - 221

EP - 237

JO - International Transactions in Operational Research

JF - International Transactions in Operational Research

SN - 0969-6016

IS - 2

ER -