Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
DOI10.1007/S10479-015-1983-5zbMATH Open1332.90177OpenAlexW2227553524MaRDI QIDQ256646FDOQ256646
Authors: S. H. Hosseinian, Masoud Jenabi, S. M. T. Fatemi Ghomi, S. A. Torabi 
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
Recommendations
- scientific article; zbMATH DE number 1488015
- A generalized Benders decomposition approach to reactive source planning in power systems
- Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience
- Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience
- Distribution system planning through a generalized Benders decomposition approach
accelerated Benders decompositioncomposite generation and transmission planningdemand side managementpower systemstransmission loss
Cites Work
- 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
- Large-scale mixed integer programming: Benders-type heuristics
- An integrated model for logistics network design
Cited In (7)
- Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems
- The Benders decomposition algorithm: a literature review
- An integrated planning model in centralized power systems
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Derivation and generation of path-based valid inequalities for transmission expansion planning
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
Uses Software
This page was built for publication: Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256646)
