Name
Title | ||
|---|---|---|
Distributed Lagrangian Method for Tie-Line Scheduling in Power Grids under Uncertainty. |
Abstract | ||
|---|---|---|
System operators (SOs) manage the grid and its assets in different parts (areas) of an interconnected power network. One would ideally seek to co-optimize the grid assets across multiple areas by solving a centralized optimization problem. Gathering the dispatch cost structures and the network constraints from all areas for a centralized solution remains difficult due to technical, historical, and sometimes legal barriers. Motivated by the need for a distributed solution architecture for multi-area power systems, we propose a distributed Lagrangian algorithm in this paper.We establish convergence rates for our algorithm that solves the deterministic tie-line scheduling problem as well as its robust variant (with policy space approximations). Our algorithm does not need any form of central coordination. We illustrate its efficacy on IEEE test systems.
|
Year | Venue | Field |
|---|---|---|
2017 | SIGMETRICS Performance Evaluation Review | Convergence (routing),Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Solution architecture,Electric power system,Large deviations theory,Optimization problem,Grid,Distributed computing |
DocType | Volume | Issue |
Journal | 45 | 2 |
Citations | PageRank | References |
1 | 0.36 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thinh Thanh Doan | 1 | 10 | 4.90 |
| Subhonmesh Bose | 2 | 10 | 3.82 |
| Carolyn L. Beck | 3 | 401 | 60.19 |