Please use this identifier to cite or link to this item:
Title: A comparison of Improved Nature-Inspired Algorithms for Optimal Power System Operation
Authors: Shehu, Gaddafi S.
Çetinkaya, Nurettin
Keywords: Fuel Cost
Nature-Inspired Optimization
Optimal Power Dispatch
Parametric Turning
Particle Swarm Optimization
Reactive Power
Bat Algorithm
Issue Date: 2018
Abstract: The influencing factors associated with the efficient operation of power systems are minimum fuel cost and losses in the transmission line. Optimal Power Dispatch (OPD) problem is treated to minimize instantaneous operating cost, incremental cost, and transmission line losses considering various network operating constraint. Newly developed Nature-inspired optimization algorithms approach are proposed in this analysis with robust parameter selections. The results of most popular Genetic Algorithm (GA) and based on swarm behavior Particle Swarm Optimization (PSO) are compared with four Nature-inspired metaheuristic algorithms of Cuckoo Search (CS), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), and Firefly Algorithm (FA). The quadratic cost function of power generation and penalty function to account for inequality constraints on dependent variables are added for solving OPD problem. A common algorithms evaluation parameters such as population size and generation limit are designated on an equal scale. Explicit parameters for each algorithm are tuned properly for optimal operations. The algorithms are tested on IEEE-26 and IEEE-30 system. Analysis Outcomes obtained showcase the efficiency of each algorithms parametric turning improvement.
ISSN: 1454-8658
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections

Show full item record

CORE Recommender


checked on Jan 30, 2023

Page view(s)

checked on Mar 27, 2023

Google ScholarTM


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.