A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
From MaRDI portal
Publication:1787329
DOI10.1007/S11081-018-9375-8zbMATH Open1397.90091arXiv1801.06580OpenAlexW2962858791MaRDI QIDQ1787329FDOQ1787329
Authors: Yanyan Li 
Publication date: 5 October 2018
Published in: Optimization and Engineering (Search for Journal in Brave)
Abstract: This paper discusses a consensus-based alternating direction method of multipliers (ADMM) approach to solve the multi-area coordinated network-constrained unit commitment (NCUC) problem in a distributed manner. Due to political and technical difficulties, it is neither practical nor feasible to solve the multi-area coordination problem in a centralized fashion, which requires full access to all data of individual areas. In comparison, in the proposed fully-distributed approach, local NCUC problems of individual areas can be solved independently, and only limited information is exchanged among adjacent areas for facilitating multi-area coordination. Furthermore, as traditional ADMM can only guarantee convergence for convex problems, this paper discusses several strategies to mitigate oscillations, enhance convergence performance, and derive good-enough feasible solutions, including: (i) A tie-line power flow based area coordination strategy is designed to reduce the number of global consensus variables; (ii) Different penalty parameters
{ho} are assigned to individual consensus variables and are updated via certain rules during the iterative procedure, which would reduce the impact of initial values of
{ho} on convergence performance; (iii) Heuristic rules are adopted to fix certain unit commitment variables for avoiding oscillations during the iterative procedure; and (iv) An asynchronous distributed strategy is studied, which solves NCUC subproblems of small areas multiple times and exchanges information with adjacent areas more frequently within one complete run of slower NCUC subproblems of large areas. Numerical cases illustrate effectiveness of the proposed asynchronous fully-distributed NCUC approach, and investigate key factors that would affect its convergence performance.
Full work available at URL: https://arxiv.org/abs/1801.06580
Recommendations
- Fully distributed dynamic economical dispatching method for power system based on alternating direction multiplier method
- Parallel alternating direction method of multipliers
- A fully distributed ADMM-based dispatch approach for virtual power plant problems
- Distributed acceleration optimization algorithm for solving economic dispatch problem
- Feasibility vs. Optimality in Distributed AC OPF: A Case Study Considering ADMM and ALADIN
Numerical mathematical programming methods (65K05) Convex programming (90C25) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Auxiliary problem principle and decomposition of optimization problems
- A Distributed Approach for the Optimal Power-Flow Problem Based on ADMM and Sequential Convex Approximations
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
- A polyhedral study of production ramping
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- Fast Consensus by the Alternating Direction Multipliers Method
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
Cited In (1)
Uses Software
This page was built for publication: A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787329)
