.png){kind=icon}
.png){kind=icon}
Return
Dynamic economic dispatch using complementary quadratic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.energy.2018.10.087.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Economic dispatch for micro-grids and district energy systems presents a highly constrained non-linear, mixed-integer optimization problem that scales exponentially with the number of systems. Energy storage technologies compound the mixed-integer or unit-commitment problem by necessitating simultaneous optimization over the applicable time horizon of the energy storage. The dispatch problem must be solved repeatedly and reliably to effectively minimize costs in real-world operation. This paper outlines a method that greatly reduces, and under some conditions eliminates, the mixed-integer aspect of the problem using complementary convex quadratic optimizations. The generalized method applies to grid-connected or islanded district energy systems comprised of any variety of electric or combined heat and power generators, electric chillers, heaters, and all varieties of energy storage systems. It incorporates constraints for generator operating bounds, ramping limitations, and energy storage inefficiencies. An open-source platform, EAGERS, implements and investigates this optimization method. Results demonstrate a >99% reduction in computational effort when comparing the newly minted optimization strategy against a benchmark commercial mixed-integer solver applied to the same combined cooling, heating, and power problem. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Economic dispatch
Energy storage
Quadratic programming
Unit commitment
Mixed-integer relaxation
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.4
Papers:
4.2W
Citations:
20.2W
Organization
View more organizations