Minimal Loss Reconfiguration Using Genetic Algorithms With Restricted Population and Addressed Operators: Real Application
J. Mendoza, R. Lopez, D. Morales et al. · IEEE Transactions on Power Systems · 2006
This paper proposes and evaluates a method that improves the adaptability and efficiency of genetic algorithms (GAs) when applied to the minimal loss reconfiguration problem. This research reduces the searching space (population) when a new codification strategy and novel genetic operators, called accentuated crossover and directed mutation, are used. This allows a drastic reduction of the computational time and minimizes the memory requirements, ensuring a efficiency search when compared to current GA reconfiguration techniques. The reduced population is created through the branches that form "system loops." This means that almost all individuals created for the GA are feasible (radial networks) generating topologies that can only be limited by the system's operational constraints. The results of the proposed reconfiguration method are compared with other techniques, yielding smaller or equal power loss values with less computational efforts.
Cited by 244 works. doi:10.1109/tpwrs.2006.873124
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- Genetic Algorithms in Search, Optimization and Machine Learning
- Genetic Algorithms + Data Structures = Evolution Programs
- An Introduction to Genetic Algorithms
- Network reconfiguration in distribution systems for loss reduction and load balancing
- Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Distribution feeder reconfiguration for loss reduction
- Evolutionary Algorithms for Solving Multi-Objective Problems
- A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques