An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
From MaRDI portal
Publication:6163589
DOI10.1007/s12597-021-00559-9OpenAlexW3207981873MaRDI QIDQ6163589
S. Ali Torabi, Moeen Sammak Jalali, Seyyed Mohammad Taghi Fatemi Ghomi, Masoud Jenabi
Publication date: 26 June 2023
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-021-00559-9
stochastic programmingdemand side managementtransmission losssample average approximationpower system planningaccelerated benders decomposition
Cites Work
- Scenario construction and reduction applied to stochastic power generation expansion planning
- Large-scale mixed integer programming: Benders-type heuristics
- An integrated model for logistics network design
- Practical enhancements to the Magnanti-Wong method
- Improving Benders decomposition using a genetic algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Optimization methods for electric utility resource planning
- Supply chain network design under uncertainty: a comprehensive review and future research directions
- The sample average approximation method applied to stochastic routing problems: a computational study
- On generating maximal nondominated Benders cuts
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- A stochastic programming approach for supply chain network design under uncertainty
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Accelerating Benders Decomposition by Local Branching
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Inexact Cuts in Benders Decomposition
This page was built for publication: An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
