The University of Southampton
University of Southampton Institutional Repository

A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty

A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty
A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty

Benders decomposition with adaptive oracles was proposed to solve large-scale optimisation problems with a column-bounded block-diagonal structure, where subproblems differ only in the right-hand side and cost coefficients. Adaptive Benders reduces computational effort significantly by iteratively building inexact cutting planes and valid upper and lower bounds. However, Adaptive Benders and standard Benders may suffer severe oscillation when solving degenerate models. Therefore, we propose stabilising Adaptive Benders with the level method and adaptively selecting which subproblems to solve each iteration for more accurate information. In addition, we propose a dynamic level method to improve the robustness of stabilised Adaptive Benders by adjusting the level set each iteration. We compare stabilised Adaptive Benders with the unstabilised versions of Adaptive Benders with one subproblem solved per iteration and standard Benders on a multi-region long-term power system investment planning problem with short-term and long-term uncertainty. The problem is formulated as multi-horizon stochastic programming. Four algorithms were implemented to solve linear programming with up to 1 billion variables and 4.5 billion constraints. The computational results show that: (a) for a 1.00% convergence tolerance, the proposed stabilised method is up to 113.7 times faster than standard Benders and 2.1 times faster than unstabilised Adaptive Benders; (b) for a 0.10% convergence tolerance, the proposed stabilised method is up to 45.5 times faster than standard Benders and unstabilised Adaptive Benders cannot solve the largest instance to convergence tolerance due to severe oscillation and (c) dynamic level method makes stabilisation more robust.

Large scale optimisation, Level method, Multi-horizon stochastic programming, Multi-stage stochastic programming, Stabilised Benders decomposition with adaptive oracles
0305-0548
Zhang, Hongyu
ac1b2192-da88-4074-bd67-696146f2d6c0
Mazzi, Nicolò
f2eafaf3-84ce-4f1c-9a24-159811a557c3
McKinnon, Ken
66558b38-692b-4de9-9eac-df24d41c4f6d
Nava, Rodrigo Garcia
bc89925d-9e9d-415d-9eda-1ad03ce58be0
Tomasgard, Asgeir
623a1e56-f338-4820-851d-97f55fe92fc0
Zhang, Hongyu
ac1b2192-da88-4074-bd67-696146f2d6c0
Mazzi, Nicolò
f2eafaf3-84ce-4f1c-9a24-159811a557c3
McKinnon, Ken
66558b38-692b-4de9-9eac-df24d41c4f6d
Nava, Rodrigo Garcia
bc89925d-9e9d-415d-9eda-1ad03ce58be0
Tomasgard, Asgeir
623a1e56-f338-4820-851d-97f55fe92fc0

Zhang, Hongyu, Mazzi, Nicolò, McKinnon, Ken, Nava, Rodrigo Garcia and Tomasgard, Asgeir (2024) A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty. Computers & Operations Research, 167, [106665]. (doi:10.1016/j.cor.2024.106665).

Record type: Article

Abstract

Benders decomposition with adaptive oracles was proposed to solve large-scale optimisation problems with a column-bounded block-diagonal structure, where subproblems differ only in the right-hand side and cost coefficients. Adaptive Benders reduces computational effort significantly by iteratively building inexact cutting planes and valid upper and lower bounds. However, Adaptive Benders and standard Benders may suffer severe oscillation when solving degenerate models. Therefore, we propose stabilising Adaptive Benders with the level method and adaptively selecting which subproblems to solve each iteration for more accurate information. In addition, we propose a dynamic level method to improve the robustness of stabilised Adaptive Benders by adjusting the level set each iteration. We compare stabilised Adaptive Benders with the unstabilised versions of Adaptive Benders with one subproblem solved per iteration and standard Benders on a multi-region long-term power system investment planning problem with short-term and long-term uncertainty. The problem is formulated as multi-horizon stochastic programming. Four algorithms were implemented to solve linear programming with up to 1 billion variables and 4.5 billion constraints. The computational results show that: (a) for a 1.00% convergence tolerance, the proposed stabilised method is up to 113.7 times faster than standard Benders and 2.1 times faster than unstabilised Adaptive Benders; (b) for a 0.10% convergence tolerance, the proposed stabilised method is up to 45.5 times faster than standard Benders and unstabilised Adaptive Benders cannot solve the largest instance to convergence tolerance due to severe oscillation and (c) dynamic level method makes stabilisation more robust.

Text
1-s2.0-S0305054824001370-main - Version of Record
Download (1MB)

More information

Accepted/In Press date: 11 April 2024
e-pub ahead of print date: 18 April 2024
Published date: 19 April 2024
Additional Information: Publisher Copyright: © 2024 The Author(s)
Keywords: Large scale optimisation, Level method, Multi-horizon stochastic programming, Multi-stage stochastic programming, Stabilised Benders decomposition with adaptive oracles

Identifiers

Local EPrints ID: 496526
URI: http://eprints.soton.ac.uk/id/eprint/496526
ISSN: 0305-0548
PURE UUID: 7a82f77c-1710-43cb-877c-b73c840bca7d
ORCID for Hongyu Zhang: ORCID iD orcid.org/0000-0002-1956-4389

Catalogue record

Date deposited: 17 Dec 2024 17:47
Last modified: 22 Aug 2025 02:46

Export record

Altmetrics

Contributors

Author: Hongyu Zhang ORCID iD
Author: Nicolò Mazzi
Author: Ken McKinnon
Author: Rodrigo Garcia Nava
Author: Asgeir Tomasgard

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×