Accelerating Benders Method Using Covering Cut Bundle Generation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Transactions in Operational Research Année : 2010

Accelerating Benders Method Using Covering Cut Bundle Generation

Georges Saharidis
  • Fonction : Auteur
Michel Minoux
  • Fonction : Auteur
  • PersonId : 846863
Marianthi Ierapetritou
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-01170363 , version 1 (01-07-2015)

Identifiants

Citer

Georges Saharidis, Michel Minoux, Marianthi Ierapetritou. Accelerating Benders Method Using Covering Cut Bundle Generation. International Transactions in Operational Research, 2010, 17 (2), pp.221-237. ⟨10.1111/j.1475-3995.2009.00706.x⟩. ⟨hal-01170363⟩
96 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More