Abstract
AbstractOver 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.