Abstract
The variability and uncertainty caused by the increased penetrations of renewable energy sources must be properly considered in day-ahead unit commitment, optimal power flow, and even real-time economic dispatch problems. Besides achieving minimum cost, modern generation schedules must satisfy a larger set of different complex constraints. These account for the generation constraints in the presence of renewable generation, network constraints affected by the distributed energy resources, bilateral contracts enclosing independent capacity provision, ancillary power auctions, net-metering and feed-in-tariff prosumers, and corrective security actions in sudden load variations or outage circumstances. In this work, a new method is presented to appropriately enhance the integration of distributed energy resources in low-inertia power grids. Based on optimal unit commitment schedules derived from priority-based dynamic programming, the potential of increasing the renewable capacity was examined, performing simulations for different scenarios. To ameliorate the expensive requirement of computational complexity, this approach aimed at eliminating the increased exploration-exploitation efforts. On the contrary, its promising solution relies on the evolutionary commitment of the next optimum configuration based on priority-list schemes to accommodate the intermittent generation progressively. This is achieved via the collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean expressions.
Highlights
Intelligent scheduling of power systems for the seamless integration of intermittent generation, weather-dependent devices, responsive appliances, and plug-in electric vehicles constitutes a crucial solution in delivering future low-carbon energy [1]
The contribution of this work is three fold: (1) exact observations can be reached through enhanced priority mechanisms and artificial neural networks; (2) an effective means of eliminating the need of stochastic search methods to provide a solution based on optimal exploration-exploitation trade-offs; and (3) a solution that is intrinsically designed to converge in the least possible number of function evaluations, decoupling the computational complexity from the number of participating generating units
A novel approach for addressing the unit commitment (UC) problem based on Boolean mapping paradigm was proposed
Summary
Intelligent scheduling of power systems for the seamless integration of intermittent generation, weather-dependent devices, responsive appliances, and plug-in electric vehicles constitutes a crucial solution in delivering future low-carbon energy [1]. To solve the large-scale, nonlinear, mixed-integer UC problem, de-commitment heuristics of generating units and reserve repair procedures were proposed [16] To this end, some representative hybrid methods are those that combine binary components to dictate whether a state will take 0 or 1 value, by making use of an exact method to handle the system-wide constraints and search mechanism to handle the non-continuous, unit-specific constraints. The contribution of this work is three fold: (1) exact observations can be reached through enhanced priority mechanisms and artificial neural networks; (2) an effective means of eliminating the need of stochastic search methods to provide a solution based on optimal exploration-exploitation trade-offs; and (3) a solution that is intrinsically designed to converge in the least possible number of function evaluations, decoupling the computational complexity from the number of participating generating units.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have