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 被引量:2
标识
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
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
lt发布了新的文献求助10
刚刚
YXHTCM完成签到,获得积分10
1秒前
1秒前
无花果应助摆烂好爽采纳,获得10
1秒前
量子星尘发布了新的文献求助10
1秒前
大个应助jjlzy采纳,获得10
1秒前
汤圆发布了新的文献求助10
1秒前
Huang完成签到,获得积分10
1秒前
Booiys完成签到,获得积分10
2秒前
星辰大海应助科研通管家采纳,获得10
2秒前
2秒前
慕青应助科研通管家采纳,获得10
2秒前
科研通AI5应助科研通管家采纳,获得10
2秒前
汉堡包应助科研通管家采纳,获得10
2秒前
orixero应助科研通管家采纳,获得10
3秒前
上官若男应助科研通管家采纳,获得10
3秒前
3秒前
Owen应助科研通管家采纳,获得10
3秒前
Orange应助善良的道消采纳,获得10
3秒前
科研通AI6应助科研通管家采纳,获得10
3秒前
H华ua应助科研通管家采纳,获得30
3秒前
慕青应助科研通管家采纳,获得10
3秒前
3秒前
脑洞疼应助科研通管家采纳,获得10
3秒前
无花果应助科研通管家采纳,获得10
3秒前
小蘑菇应助科研通管家采纳,获得10
3秒前
完美世界应助科研通管家采纳,获得30
3秒前
3秒前
3秒前
shhoing应助科研通管家采纳,获得10
3秒前
4秒前
华仔应助清脆的婷冉采纳,获得10
4秒前
4秒前
Leo完成签到,获得积分10
4秒前
赘婿应助科研通管家采纳,获得10
4秒前
4秒前
小刘医生发布了新的文献求助10
4秒前
哭泣的映寒完成签到 ,获得积分10
4秒前
无敌kkk发布了新的文献求助30
5秒前
LILI发布了新的文献求助10
5秒前
高分求助中
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
The Pedagogical Leadership in the Early Years (PLEY) Quality Rating Scale 410
Modern Britain, 1750 to the Present (第2版) 300
Writing to the Rhythm of Labor Cultural Politics of the Chinese Revolution, 1942–1976 300
Lightning Wires: The Telegraph and China's Technological Modernization, 1860-1890 250
Psychology for Teachers 220
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4598884
求助须知:如何正确求助?哪些是违规求助? 4009687
关于积分的说明 12413038
捐赠科研通 3689309
什么是DOI,文献DOI怎么找? 2033794
邀请新用户注册赠送积分活动 1066934
科研通“疑难数据库(出版商)”最低求助积分说明 952021