Exploring a New Novel Nature-Inspired Optimization for Economic Dispatch in Power Systems: Comparative Study with Established Metaheuristics
Alt Text: Exploring a New Novel Nature-Inspired Optimization for Economic Dispatch in Power Systems
Title: Exploring a New Novel Nature-Inspired Optimization for Economic Dispatch in Power Systems
Caption: A comparative study of novel optimization algorithms for Economic Dispatch in power systems.
Description: This study presents a new nature-inspired optimization technique for Economic Dispatch, comparing it with ten metaheuristic methods, highlighting superior cost efficiency and computational speed.
Keywords: Economic Load Dispatch, Metaheuristics, Optimization Algorithm, Power Systems, Nature-inspired
International Journal of Engineering and Techniques – Volume 10 Issue 3, May 2024
Supratim Gupta1, Dr. Sujata Gupta2
1Department of Electrical Engineering, MAKAUT, Kolkata. Email: supratim0192@gmail.com
2Associate Professor, Marketing Management, IMS Business School, Kolkata. Email: sgpt1234@gmail.com
Abstract
This paper introduces a novel optimization algorithm for solving the economic dispatch (ED) problem in power systems. Tested on a three-generator system with load demands of 585 MW, 700 MW, and 800 MW, it is compared against ten metaheuristic algorithms, including Harmony Search, Cuckoo Search, Flower Pollination Algorithm, Memetic Algorithm, Bee Algorithm, Wolf Search Algorithm, Cat Swarm Optimization, Krill Herd Algorithm, Monkey Search, and Shuffled Frog Leaping Algorithm. The study evaluates total generation cost, computation time, output variability, and convergence. The proposed algorithm demonstrates superior cost efficiency and speed, making it ideal for real-time ED applications.
Keywords
Economic Load Dispatch, ELD, Metaheuristics, Nature-inspired, Optimization Algorithm
How to Cite
Gupta, S., Gupta, S., “Exploring a New Novel Nature-Inspired Optimization for Economic Dispatch in Power Systems,” International Journal of Engineering and Techniques, Volume 10, Issue 3, May 2024. ISSN 2395-1303
Post Comment