skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays

Abstract

In power system operation, economic dispatch problem (EDP) is designed to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient-push method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. It has been shown that the proposed method is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.

Authors:
; ; ; ; ; ;
Publication Date:
Research Org.:
Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1358503
Report Number(s):
PNNL-SA-114079
Journal ID: ISSN 0278-0046
DOE Contract Number:
AC05-76RL01830
Resource Type:
Journal Article
Resource Relation:
Journal Name: IEEE Translations on Industrial Electronics; Journal Volume: 64; Journal Issue: 6
Country of Publication:
United States
Language:
English

Citation Formats

Yang, Tao, Lu, Jie, Wu, Di, Wu, Junfeng, Shi, Guodong, Meng, Ziyang, and Johansson, Karl Henrik. A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays. United States: N. p., 2017. Web. doi:10.1109/TIE.2016.2617832.
Yang, Tao, Lu, Jie, Wu, Di, Wu, Junfeng, Shi, Guodong, Meng, Ziyang, & Johansson, Karl Henrik. A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays. United States. doi:10.1109/TIE.2016.2617832.
Yang, Tao, Lu, Jie, Wu, Di, Wu, Junfeng, Shi, Guodong, Meng, Ziyang, and Johansson, Karl Henrik. 2017. "A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays". United States. doi:10.1109/TIE.2016.2617832.
@article{osti_1358503,
title = {A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays},
author = {Yang, Tao and Lu, Jie and Wu, Di and Wu, Junfeng and Shi, Guodong and Meng, Ziyang and Johansson, Karl Henrik},
abstractNote = {In power system operation, economic dispatch problem (EDP) is designed to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient-push method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. It has been shown that the proposed method is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.},
doi = {10.1109/TIE.2016.2617832},
journal = {IEEE Translations on Industrial Electronics},
number = 6,
volume = 64,
place = {United States},
year = 2017,
month = 6
}
  • When generation is insufficient to support all loads under emergencies, effective and efficient load shedding needs to be deployed in order to maintain the supply-demand balance. This paper presents a distributed load shedding algorithm, which makes efficient decision based on the discovered global information. In the global information discovery process, each load only communicates with its neighboring load via directed communication links possibly with arbitrarily large but bounded time varying communication delays. We propose a novel distributed information discovery algorithm based on ratio consensus. Simulation results are used to validate the proposed method.
  • In this paper, we consider the economic dispatch problem (EDP), where a cost function that is assumed to be strictly convex is assigned to each of distributed energy resources (DERs), over packet dropping networks. The goal of a standard EDP is to minimize the total generation cost while meeting total demand and satisfying individual generator output limit. We propose a distributed algorithm for solving the EDP over networks. The proposed algorithm is resilient against packet drops over communication links. Under the assumption that the underlying communication network is strongly connected with a positive probability and the packet drops are independentmore » and identically distributed (i.i.d.), we show that the proposed algorithm is able to solve the EDP. Numerical simulation results are used to validate and illustrate the main results of the paper.« less
  • Economic dispatch problem (EDP) is an important problem in power systems. It can be formulated as an optimization problem with the objective to minimize the total generation cost subject to the power balance constraint and generator capacity limits. Recently, several consensus-based algorithms have been proposed to solve EDP in a distributed manner. However, impacts of communication time delays on these distributed algorithms are not fully understood, especially for the case where the communication network is directed, i.e., the information exchange is unidirectional. This paper investigates communication time delay effects on a distributed algorithm for directed communication networks. The algorithm hasmore » been tested by applying time delays to different types of information exchange. Several case studies are carried out to evaluate the effectiveness and performance of the algorithm in the presence of time delays in communication networks. It is found that time delay effects have negative effects on the convergence rate, and can even result in an incorrect converge value or fail the algorithm to converge.« less
  • The paper presents results from the development and testing of an algorithm for security constrained dispatch calculations wherein closed area MW, line MW and MVA, and line-group MW constraints must be considered to insure system security. An overview of the algorithm and partial results from full-scale benchmark tests using a real-time 1200 bus/1500 line model and an optimal power flow (OPF) are presented in the body of the paper. Several appendices are included to outline the techniques used in the algorithm development.