A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem
This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming at minimizing power losses while keeping network con...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-09-01
|
Series: | Energies |
Subjects: | |
Online Access: | http://www.mdpi.com/1996-1073/11/9/2352 |
_version_ | 1798006107101200384 |
---|---|
author | Walter M. Villa-Acevedo Jesús M. López-Lezama Jaime A. Valencia-Velásquez |
author_facet | Walter M. Villa-Acevedo Jesús M. López-Lezama Jaime A. Valencia-Velásquez |
author_sort | Walter M. Villa-Acevedo |
collection | DOAJ |
description | This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming at minimizing power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification of both feasibility and optimality. The SGA is examined and tested with the recommended constraint handling approach and the traditional penalization of deviations from feasible solutions. Several tests are run in the IEEE 30, 57, 118 and 300 bus test power systems. The results obtained with the proposed approach are compared to those offered by other metaheuristic techniques reported in the specialized literature. Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques. |
first_indexed | 2024-04-11T12:49:51Z |
format | Article |
id | doaj.art-70d44477c31945d188294b45e4ed8736 |
institution | Directory Open Access Journal |
issn | 1996-1073 |
language | English |
last_indexed | 2024-04-11T12:49:51Z |
publishDate | 2018-09-01 |
publisher | MDPI AG |
record_format | Article |
series | Energies |
spelling | doaj.art-70d44477c31945d188294b45e4ed87362022-12-22T04:23:14ZengMDPI AGEnergies1996-10732018-09-01119235210.3390/en11092352en11092352A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch ProblemWalter M. Villa-Acevedo0Jesús M. López-Lezama1Jaime A. Valencia-Velásquez2Departamento de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de Antioquia, Calle 70 No 52-21, Medellín 050010, ColombiaDepartamento de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de Antioquia, Calle 70 No 52-21, Medellín 050010, ColombiaDepartamento de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de Antioquia, Calle 70 No 52-21, Medellín 050010, ColombiaThis paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming at minimizing power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification of both feasibility and optimality. The SGA is examined and tested with the recommended constraint handling approach and the traditional penalization of deviations from feasible solutions. Several tests are run in the IEEE 30, 57, 118 and 300 bus test power systems. The results obtained with the proposed approach are compared to those offered by other metaheuristic techniques reported in the specialized literature. Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques.http://www.mdpi.com/1996-1073/11/9/2352genetic algorithmsreactive power dispatchmetaheuristic optimizationpenalty functionsconstraint handling |
spellingShingle | Walter M. Villa-Acevedo Jesús M. López-Lezama Jaime A. Valencia-Velásquez A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem Energies genetic algorithms reactive power dispatch metaheuristic optimization penalty functions constraint handling |
title | A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem |
title_full | A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem |
title_fullStr | A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem |
title_full_unstemmed | A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem |
title_short | A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem |
title_sort | novel constraint handling approach for the optimal reactive power dispatch problem |
topic | genetic algorithms reactive power dispatch metaheuristic optimization penalty functions constraint handling |
url | http://www.mdpi.com/1996-1073/11/9/2352 |
work_keys_str_mv | AT waltermvillaacevedo anovelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem AT jesusmlopezlezama anovelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem AT jaimeavalenciavelasquez anovelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem AT waltermvillaacevedo novelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem AT jesusmlopezlezama novelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem AT jaimeavalenciavelasquez novelconstrainthandlingapproachfortheoptimalreactivepowerdispatchproblem |