Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
From MaRDI portal
Publication:256646
DOI10.1007/s10479-015-1983-5zbMath1332.90177OpenAlexW2227553524MaRDI QIDQ256646
S. H. Hosseinian, Masoud Jenabi, S. Ali Torabi, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1983-5
power systemsaccelerated Benders decompositioncomposite generation and transmission planningdemand side managementtransmission loss
Related Items
Derivation and generation of path-based valid inequalities for transmission expansion planning, An integrated planning model in centralized power systems, Accelerating Benders decomposition: multiple cuts via multiple solutions, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, The Benders decomposition algorithm: a literature review, A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Uses Software
Cites Work
- 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
- Developing concurrent investment plans for power generation and transmission
- Decomposition algorithms for stochastic programming on a computational grid
- On generating maximal nondominated Benders cuts
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- A stochastic programming approach for supply chain network design under uncertainty
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- Accelerating Benders Decomposition by Local Branching
- Accelerating Benders method using covering cut bundle generation
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Inexact Cuts in Benders Decomposition
- Error Detecting and Error Correcting Codes
