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]
标识
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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
rocky15应助学术底层fw采纳,获得30
1秒前
1秒前
领导范儿应助悬夜采纳,获得10
5秒前
kang发布了新的文献求助10
5秒前
许小仙儿完成签到,获得积分10
5秒前
6秒前
可可发布了新的文献求助10
6秒前
7秒前
rocky15应助坚强的笑天采纳,获得10
9秒前
辉尝不错关注了科研通微信公众号
9秒前
9秒前
rocky15应助杨冠文采纳,获得10
10秒前
风宝宝发布了新的文献求助30
10秒前
harry发布了新的文献求助100
12秒前
小蓝人完成签到 ,获得积分10
13秒前
完美世界应助大方的天晴采纳,获得10
14秒前
rocky15应助May采纳,获得30
15秒前
英俊的铭应助十一采纳,获得10
15秒前
16秒前
17秒前
马马完成签到 ,获得积分10
17秒前
shikaly完成签到,获得积分10
18秒前
21秒前
22秒前
阳光的冰巧完成签到,获得积分10
22秒前
smile完成签到,获得积分10
22秒前
24秒前
25秒前
NINI发布了新的文献求助10
26秒前
27秒前
充电宝应助yy123采纳,获得10
27秒前
呵呵发布了新的文献求助10
28秒前
朱古力发布了新的文献求助30
29秒前
xiami完成签到,获得积分10
29秒前
喜气洋洋完成签到 ,获得积分10
30秒前
Zyk发布了新的文献求助10
32秒前
嘦烎发布了新的文献求助10
32秒前
伊丽莎白完成签到,获得积分10
34秒前
高分求助中
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 1000
Corrosion and Oxygen Control 600
Python Programming for Linguistics and Digital Humanities: Applications for Text-Focused Fields 500
Heterocyclic Stilbene and Bibenzyl Derivatives in Liverworts: Distribution, Structures, Total Synthesis and Biological Activity 500
重庆市新能源汽车产业大数据招商指南(两链两图两池两库两平台两清单两报告) 400
Division and square root. Digit-recurrence algorithms and implementations 400
行動データの計算論モデリング 強化学習モデルを例として 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2546966
求助须知:如何正确求助?哪些是违规求助? 2176023
关于积分的说明 5602041
捐赠科研通 1896796
什么是DOI,文献DOI怎么找? 946401
版权声明 565379
科研通“疑难数据库(出版商)”最低求助积分说明 503684