Loading

Flower Pollination Algorithm for Solving Economic Dispatch Problems with Prohibited Operating Zones and Multiple Fuel Options
Y. V. Krishna Reddy1, M. Damodar Reddy2

1Y. Venkata Krishna Reddy, Department of Electronics and Electrical Engineering, Sri Venkateswara University, Tirupati (Andhra Pradesh), India.
2Dr. M. Damodar Reddy, Department of Electronics and Electrical Engineering, Sri Venkateswara University, Tirupati (Andhra Pradesh), India.

Manuscript received on 18 August 2018 | Revised Manuscript received on 27 August 2018 | Manuscript published on 30 August 2018 | PP: 1-7 | Volume-7 Issue-6, August 2018 | Retrieval Number: F5423087618/18©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: A nature inspired optimization algorithm based on the transfer of pollen in universe called the Flower Pollination Algorithm, is implemented for solving economic dispatch (ED) problems with considering prohibited operating zones (POZs), and multiple fuel options including valve-point loading. The proposed method mainly depends on biotic pollination for transfer of pollens by using pollinators such as birds and insects, in order to find the survival of the fittest and the optimal reproduction of flowering plants. This algorithm has been exercised on three test systems (6, 15 and 10 units) with POZS and multiple fuel options for solving ED problems. The numerical results are compared with results of some new methods to verify the quality of FPA for solving ED problems. The result analyses prove the effectiveness of the FPA algorithm and show that it could be outlasts technique for solving ED problems in terms of total cost and computational time.
Keywords: Economic Dispatch, Flower Pollination Algorithm, Prohibited Operating Zones, Multiple Fuels, Valve-Point Loading.

Scope of the Article: Algorithm Engineering