Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs

本德分解 数学优化 随机规划 CVAR公司 实施 趋同(经济学) 计算机科学 数学 预期短缺 风险管理 经济增长 经济 管理 程序设计语言
作者
Cristian Ramírez-Pico,Ivana Ljubić,Eduardo Moreno
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:57 (5): 1252-1275 被引量:16
标识
DOI:10.1287/trsc.2022.0073
摘要

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. Funding: Financial support from Agencia Nacional de Investigación y Desarrollo - Chile [FONDECYT 1200809] and STIC-Amsud [STIC19007] is gratefully acknowledged.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
友好的若剑完成签到,获得积分10
1秒前
隐形的水云完成签到,获得积分10
1秒前
1秒前
情怀应助秦婧采纳,获得10
1秒前
星辰大海应助xiyang采纳,获得10
3秒前
3秒前
林雪完成签到 ,获得积分10
3秒前
zjaaiywj完成签到,获得积分10
4秒前
4秒前
5秒前
5秒前
Gstring完成签到,获得积分10
6秒前
7秒前
香蕉觅云应助知还采纳,获得10
7秒前
7秒前
7秒前
lcsw发布了新的文献求助10
7秒前
yofaz发布了新的文献求助10
9秒前
嘿嘿嘿发布了新的文献求助20
9秒前
9秒前
9秒前
9秒前
xwtx发布了新的文献求助10
10秒前
酷炫的海之完成签到,获得积分10
10秒前
liub13发布了新的文献求助10
11秒前
风听你讲发布了新的文献求助10
11秒前
11秒前
今后应助石梓硕采纳,获得10
11秒前
13秒前
超级无敌大富婆完成签到,获得积分10
13秒前
13秒前
14秒前
qq发布了新的文献求助10
14秒前
15秒前
啊吧芜完成签到,获得积分10
15秒前
Aiman完成签到,获得积分10
16秒前
DajeVn完成签到,获得积分10
16秒前
RJ发布了新的文献求助10
16秒前
牛X发布了新的文献求助10
16秒前
嘿嘿嘿完成签到,获得积分20
17秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The Effective Clinical Neurologist 3ed 500
The Great Hymn to Šamaš 500
Moody's Ratings Rising AI spending narrows the gap, but US hyperscalers retain edge over Chinese peers 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7696282
求助须知:如何正确求助?哪些是违规求助? 9256446
关于积分的说明 20002619
捐赠科研通 7270624
什么是DOI,文献DOI怎么找? 3292663
关于科研通互助平台的介绍 2448307
邀请新用户注册赠送积分活动 2298374