| |
Records |
Links |
|
Author |
Munoz, F.D.; Hobbs, B.F.; Watson, J.P. |
|
| |
Title |
New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints |
Type |
|
| |
Year |
2016 |
Publication |
European Journal Of Operational Research |
Abbreviated Journal |
Eur. J. Oper. Res. |
|
| |
Volume |
248 |
Issue |
3 |
Pages |
888-898 |
|
| |
Keywords |
OR in energy; Stochastic programming; Benders decomposition |
|
| |
Abstract |
We propose a novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems that have to consider a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen's inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders' algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen's inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. However, the decomposition phase is required to attain optimality gaps. Use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved. |
|
| |
Address |
[Munoz, F. D.] Univ Adolfo Ibanez, Fac Sci & Engn, Santiago, Chile, Email: fdmunoz@uai.cl; |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Elsevier Science Bv |
Place of Publication |
|
Editor |
|
|
| |
Language |
English |
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0377-2217 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
WOS:000364603700013 |
Approved |
|
|
| |
Call Number |
UAI @ eduardo.moreno @ |
Serial |
535 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ramirez-Pico, C.; Ljubic, I.; Moreno, E. |
|
| |
Title |
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs |
Type |
|
| |
Year |
2023 |
Publication |
Transportation Science |
Abbreviated Journal |
Transp. Sci. |
|
| |
Volume |
Early Access |
Issue |
|
Pages |
|
|
| |
Keywords |
two-stage stochastic programming; Benders decomposition; network flow; conditional value-at-risk; facility location |
|
| |
Abstract |
Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of the second stage subproblems with individual variables and progressively forcing those variables to reach the optimal value of the subproblems, dynamically inserting additional valid constraints, known as Benders cuts. Most traditional implementations add a cut for each scenario (multicut) or a single cut that includes all scenarios. In this paper, we present a novel Benders adaptive-cuts method, where the Benders cuts are aggregated according to a partition of the scenarios, which is dynamically refined using the linear program-dual information of the subproblems. This scenario aggregation/disaggregation is based on the Generalized Adaptive Partitioning Method (GAPM), which has been successfully applied to TSSPs. We formalize this hybridization of Benders decomposition and the GAPM by providing sufficient conditions under which an optimal solution of the deterministic equivalent can be obtained in a finite number of iterations. Our new method can be interpreted as a compromise between the Benders single-cuts and multicuts methods, drawing on the advantages of both sides, by rendering the initial iterations faster (as for the single-cuts Benders) and ensuring the overall faster convergence (as for the multicuts Benders). Computational experiments on three TSSPs [the Stochastic Electricity Planning, Stochastic Multi Commodity Flow, and conditional value-at-risk (CVaR) Facility Location] validate these statements, showing that the new method outperforms the other implementations of Benders methods, as well as other standard methods for solving TSSPs, in particular when the number of scenarios is very large. Moreover, our study demonstrates that the method is not only effective for the risk-neutral decision makers, but also that it can be used in combination with the risk-averse CVaR objective. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0041-1655 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
WOS:001011928100001 |
Approved |
|
|
| |
Call Number |
UAI @ alexi.delcanto @ |
Serial |
1814 |
|
| Permanent link to this record |
