Open AccessFlower HPollination HAlgorithm Hto HSolve HDynamic HEconomic HLoading Hof HUnits Hwith HPractical HConstraints
Author(s) -
SY V Krishna Reddy*,
M. Damodar Reddy,
A V Sudhkara Reddy
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.a9252.098319
Subject(s) - schedule , robustness (evolution) , computer science , mathematical optimization , power (physics) , control theory (sociology) , operations research , mathematics , artificial intelligence , operating system , biochemistry , chemistry , physics , control (management) , quantum mechanics , gene
Dynamic h“economic load dispatch (DELD) aims to obtain optimum generation schedule of the committed generating units’ output over ha certain timing horizon”, sustaining practical restrictions and power demands in each period.”Valve-point effect, the ramp up/down limits, prohibited operation zones (POZs), and power losses form the hDELD has ha complex, non-linear liable’ problem. The Flower Pollination Algorithm (FPA) his therefore anticipated in this paper to solve such a complex issue. The practicality of the proposed FPA method is assessed by conducting simulations at different load patterns hon standard 5-unit and 10-unit systems for ha 24-hour schedule. The FPA's simulation results hare related to other previously published biography techniques. These results clearly show that the skill hand robustness hof the proposed FPA method to solve the non h- linear DELD problem has been restricted.