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 被引量:14
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Borw完成签到,获得积分10
1秒前
风中的惊蛰完成签到,获得积分10
2秒前
qqq完成签到,获得积分20
2秒前
科研通AI6.1应助鹿鹿采纳,获得10
4秒前
Winnie完成签到,获得积分10
6秒前
6秒前
善学以致用应助归海含烟采纳,获得10
7秒前
7秒前
飞翔的梦完成签到,获得积分10
7秒前
Ava应助研友_赖冰凡采纳,获得10
9秒前
^O^发布了新的文献求助10
10秒前
www完成签到,获得积分10
10秒前
wjp完成签到,获得积分10
12秒前
亮不卡完成签到 ,获得积分10
14秒前
14秒前
14秒前
ysx完成签到 ,获得积分10
14秒前
酷波er应助2984900855采纳,获得10
15秒前
16秒前
16秒前
16秒前
李健的小迷弟应助筱菱采纳,获得10
17秒前
单纯板栗发布了新的文献求助10
17秒前
852应助someone采纳,获得80
18秒前
18秒前
feihu发布了新的文献求助10
19秒前
热心市民小杨应助zz采纳,获得10
19秒前
19秒前
19秒前
东阳发布了新的文献求助10
20秒前
wz1666完成签到,获得积分10
20秒前
You完成签到,获得积分10
21秒前
21秒前
he发布了新的文献求助10
21秒前
pluto应助keeptg采纳,获得10
21秒前
22秒前
23秒前
朱思羽完成签到 ,获得积分10
23秒前
mmm发布了新的文献求助10
24秒前
瘦瘦安蕾完成签到 ,获得积分10
24秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Modern Epidemiology, Fourth Edition 5000
Kinesiophobia : a new view of chronic pain behavior 5000
Molecular Biology of Cancer: Mechanisms, Targets, and Therapeutics 3000
Digital Twins of Advanced Materials Processing 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
Signals, Systems, and Signal Processing 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 化学工程 生物化学 物理 计算机科学 内科学 复合材料 催化作用 物理化学 光电子学 电极 冶金 细胞生物学 基因
热门帖子
关注 科研通微信公众号,转发送积分 6018459
求助须知:如何正确求助?哪些是违规求助? 7607110
关于积分的说明 16159240
捐赠科研通 5166074
什么是DOI,文献DOI怎么找? 2765191
邀请新用户注册赠送积分活动 1746699
关于科研通互助平台的介绍 1635359