Loading…
Finding Solutions for Optimal Reactive Power Dispatch Problem by a Novel Improved Antlion Optimization Algorithm
In this paper, a novel improved Antlion optimization algorithm (IALO) has been proposed for solving three different IEEE power systems of optimal reactive power dispatch (ORPD) problem. Such three power systems with a set of constraints in transmission power networks such as voltage limitation of al...
Saved in:
Published in: | Energies (Basel) 2019-08, Vol.12 (15), p.2968 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, a novel improved Antlion optimization algorithm (IALO) has been proposed for solving three different IEEE power systems of optimal reactive power dispatch (ORPD) problem. Such three power systems with a set of constraints in transmission power networks such as voltage limitation of all buses, limitations of tap of all transformers, maximum power transmission limitation of all conductors and limitations of all capacitor banks have given a big challenge for global optimal solution search ability of the proposed method. The proposed IALO method has been developed by modifying new solution generation technique of standard antlion optimization algorithm (ALO). By optimizing three single objective functions of systems with 30, 57 and 118 buses, the proposed method has been demonstrated to be more effective than ALO in terms of the most optimal solution search ability, solution search speed and search stabilization. In addition, the proposed method has also been compared to other existing methods and it has obtained better results than approximately all compared ones. Consequently, the proposed IALO method is deserving of a potential optimization tool for solving ORPD problem and other optimization problems in power system optimization fields. |
---|---|
ISSN: | 1996-1073 1996-1073 |
DOI: | 10.3390/en12152968 |