Optimal Power Distribution Network Reconfiguration using Cuckoo Search
This paper presents an adaptation of a new metaheuristic algorithm known as Cuckoo Search (CS) to solve the distribution network reconfiguration problem (DNRC), where the objective is to minimize the real power losses subject to constraints such as voltage levels in nodes, current levels in branches...
- Autores:
-
Herazo, Efren
Quintero, Michell
Candelo, John
Soto, Jose
Guerrero, Javier
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2015
- Institución:
- Corporación Universidad de la Costa
- Repositorio:
- REDICUC - Repositorio CUC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.cuc.edu.co:11323/8594
- Acceso en línea:
- https://hdl.handle.net/11323/8594
https://doi.org/10.1109/EPECS.2015.7368548
https://repositorio.cuc.edu.co/
- Palabra clave:
- Ant Colony Optimization
Cuckoo Search algorithm
distribution system
distribution network reconfiguration
real power
- Rights
- openAccess
- License
- Attribution-NonCommercial-NoDerivatives 4.0 International
| Summary: | This paper presents an adaptation of a new metaheuristic algorithm known as Cuckoo Search (CS) to solve the distribution network reconfiguration problem (DNRC), where the objective is to minimize the real power losses subject to constraints such as voltage levels in nodes, current levels in branches, and maintaining a radial topology in the distribution test system. The performance of the proposed method is compared with a popular meta-heuristic algorithm, Ant Colony Optimization (ACO). The methods have been tested on the IEEE 37 bus radial distribution system. Experiments were carried out to compare the simulation time, which is a critical measure for the real implementation of the method in real power distribution systems. |
|---|