Research Article | OPEN ACCESS
Multiobjective Optimal Reactive Power Dispatch Considering Voltage Stability Using Shuffled Frog Leaping Algorithm
1V. Tamilselvan, 1M. Sathish and 2T. Jayabarathi
1Department of Electrical and Electronics Engineering, Adhiyamaan College of Engineering, Hosur
2School of Electrical Engineering, VIT University, Vellore, Tamilnadu, India
Research Journal of Applied Sciences, Engineering and Technology 2015 3:315-321
Received: December 26, 2014 | Accepted: February 8, 2015 | Published: May 30, 2015
Abstract
This study addresses a shuffled frog leaping algorithm for solving the multi-objective reactive power dispatch problem in a power system. Optimal Reactive Power Dispatch (ORPD) is formulated as a nonlinear, multi-modal and mixed-variable problem. The intended technique is based on the minimization of the real power loss, minimization of voltage deviation and maximization of the voltage stability margin. Generator voltages, capacitor banks and tap positions of tap changing transformers are used as optimization variables of this problem. A memetic meta-heuristic named as shuffled frog-leaping algorithm is intended to solve multi-objective optimal reactive power dispatch problems considering voltage stability margin and voltage deviation. The Shuffled Frog-Leaping Algorithm (SFLA) is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The most important benefit of this algorithm is higher speed of convergence to a better solution. The intended method is applied to ORPD problem on IEEE 57 bus power systems and compared with two versions of differential evolutionary algorithm. The simulation results show the effectiveness of the intended method.
Keywords:
Multi objective optimization , reactive power dispatch , shuffled frog-leap algorithm,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|