A distributed asynchronous algorithm for the two-stage stochastic unit commitment problem
Ignacio Aravena, Anthony Papavasiliou · IEEE Power & Energy Society General Meeting (PESGM) · 2015
We present a distributed asynchronous algorithm for solving the two-stage stochastic unit commitment problem. The algorithm uses Lagrangian relaxation to decompose the problem by scenarios and applies an incremental method to solve the dual problem. At each incremental dual iteration, the algorithm evaluates the dual function, providing a lower bound, and recovers a feasible commitment for first stage units, which (through a feasibility recovery process) results in an upper bound. Both the incremental dual iterations as well as the feasibility recovery are executed asynchronously, resulting in more efficient utilization of parallel processors. The method is tested on a model of the Central Western European system, for which it achieved convergence three times faster than an equivalent distributed synchronous algorithm.
Cited by 25 works. doi:10.1109/pesgm.2015.7285913
Authors
References
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- A stochastic model for the unit commitment problem
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Economic Valuation of Reserves in Power Systems With High Penetration of Wind Power
- Uncertainty Management in the Unit Commitment Problem
- Stochastic optimization of unit commitment: a new decomposition framework
- Distributed Asynchronous Incremental Subgradient Methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization