.png){kind=icon}
Return
A Distributed Auction-Based Algorithm for the Nonconvex Economic Dispatch Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2013.2287807.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a distributed algorithm based on auction techniques and consensus protocols to solve the nonconvex economic dispatch problem. The optimization problem of the nonconvex economic dispatch includes several constraints such as valve-point loading effect, multiple fuel option, and prohibited operating zones. Each generating unit locally evaluates quantities used as bids in the auction mechanism. These units send their bids to their neighbors in a communication graph that supports the power system and which provides the required information flow. A consensus procedure is used to share the bids among the network agents and resolves the auction. As a result, the power distribution of generating units is updated and the generation cost is minimized. The effectiveness of this approach is demonstrated by simulations on standard test systems.
Keywords:
Auction algorithm
distributed algorithm
economic dispatch (ED)
nonconvex optimization
smart grid
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.9
Papers:
8.6K
Citations:
6.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveOptimal Dispatch of Electric Vehicles and Wind Power Using Enhanced Particle Swarm Optimization
PREAI
ShareSaveParticle swarm optimization to solving the economic dispatch considering the generator constraints
OAAI
OAAIShareSaveShareSave
View more