English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A Finite-Time Distributed Optimization Algorithm for Economic Dispatch in Smart Grids

Mao, S., Dong, Z., Schultz, P., Tang, Y., Meng, K., Dong, Z. Y., Qian, F. (2021): A Finite-Time Distributed Optimization Algorithm for Economic Dispatch in Smart Grids. - IEEE Transactions on Systems, Man, and Cybernetics: Systems, 51, 4, 2068-2079.
https://doi.org/10.1109/TSMC.2019.2931846

Item is

Basic

show hide
Item Permalink: https://publications.pik-potsdam.de/pubman/item/item_23366 Version Permalink: https://publications.pik-potsdam.de/pubman/item/item_23366_6
Genre: Journal Article

Files

show Files
hide Files
:
23366.pdf (Publisher version), 2MB
 
File Permalink:
-
Name:
23366.pdf
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mao, S.1, Author
Dong, Z.1, Author
Schultz, Paul2, Author              
Tang, Y.1, Author
Meng, K.1, Author
Dong, Z. Y.1, Author
Qian, F.1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Potsdam Institute for Climate Impact Research, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: The economic dispatch problem (EDP) is one of the fundamental and important problems in power systems. The objective of EDP is to determine the output generation of generators to minimize the total generation cost under various constraints. In this article, a finite-time consensus-based distributed optimization algorithm is proposed to solve EDP. It is only required that each device in the communication network has access to its own local generation cost function, designed virtual local demand and its neighbors' local optimization variables. The proposed finite-time algorithm can solve EDP, if the gain parameters in the algorithm satisfy some conditions under undirected and connected time-varying graphs. Moreover, the bounded or linear increasing assumption on the gradient and subgradient of objecive functions is relaxed in this algorithm. Examples under several cases are provided to verify the effectiveness of the proposed distributed optimization algorithm.

Details

show
hide
Language(s):
 Dates: 20192021-04-01
 Publication Status: Finally published
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: DOI: 10.1109/TSMC.2019.2931846
PIKDOMAIN: RD4 - Complexity Science
eDoc: 8618
Organisational keyword: RD4 - Complexity Science
Research topic keyword: Nonlinear Dynamics
Research topic keyword: Energy
Research topic keyword: Complex Networks
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Source Genre: Journal, SCI, Scopus
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 51 (4) Sequence Number: - Start / End Page: 2068 - 2079 Identifier: Other: 2168-2216
CoNE: https://publications.pik-potsdam.de/cone/journals/resource/IEEE-transactions-systems-man-cybernetics
Publisher: Institute of Electrical and Electronics Engineers (IEEE)