Producción Científica Profesorado

Feasible Solution Constraint-Handling Genetic Algorithm to Power Economic Dispatch



Seck Tuoh Mora, Juan Carlos

2012

Calderon, F., Fuerte-Esquivel, C. R., Flores, J. J., Silva-Chavez, J. C., Seck-Tuoh-Mora, J. C. (2012). Feasible Solution Constraint-Handling Genetic Algorithm to Power Economic Dispatch. International Review of Electrical Engineering-IREE, 7(2), 4283-4291.


Abstract


This paper presents a new constraint-handling genetic approach based on preserving feasibility of solutions of the economic dispatch problem. A real-coded genetic algorithm is implemented to minimize the active power generation cost while satisfying both power balance and generating limit constraints automatically during the optimization process. This is achieved by introducing a novel strategy which generates solutions within the hyperspace bounded by the problem constraints, such that individuals are only produced on the feasible part of the search space that fulfill all constraints. Computer simulations on two benchmark electrical power systems show the prowess of the proposed approach whose results are similar to those reported by other authors using different methods.






Artículos relacionados

Elementary cellular automaton Rule 110 explained as a block substitution system

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

On explicit inversion of a subclass of operators with D-difference kernels and Weyl theory of the co...

Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.

Complex Dynamics Emerging in Rule 30 with Majority Memory

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks