z-logo
open-access-imgOpen Access
Practical multi‐area bi‐objective environmental economic dispatch equipped with a hybrid gradient search method and improved Jaya algorithm
Author(s) -
AzizipanahAbarghooee Rasoul,
Dehghanian Payman,
Terzija Vladimir
Publication year - 2016
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2016.0333
Subject(s) - economic dispatch , mathematical optimization , computer science , electric power system , smoothness , pareto principle , grid , disjoint sets , electricity , power (physics) , mathematics , engineering , quantum mechanics , mathematical analysis , physics , geometry , combinatorics , electrical engineering
Generation dispatch decision making integrated into a centralised wholesale electricity market has been always a challenging concern for transmission system operators. The reason lies mainly in the complex and highly‐interconnected structure of the grid, escalated demand, and the crisis of the amount and price of energy. For the dispatch solutions to be highly reliable with an acceptable level of accuracy, several factors need to be taken into account, among which one can mention the valve‐point effect, multiple fuel options, disjoint prohibited zones, up/down ramp rate requirements of units, as well as the spinning reserve constraints which, in turn, intensify the non‐smoothness, non‐convexity, non‐linearity, and dynamic restriction of such combinatorial problems. This study proposes a new optimization toolset for the bi‐objective multi‐area economic dispatch problem to determine the transmission power flow and power output of units while satisfying system demand and security constraints at each area. The proposed architecture builds on an improved gradient‐based Jaya algorithm to generate a feasible set of Pareto‐optimal solutions corresponding to the operation cost and emission calculated through a new robust bi‐objective gradient‐based method. The projected algorithm is proved to be capable of finding the robust global or near‐global Pareto solutions fast and accurate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here