A novel variable neighborhood descent algorithm for service restoration in radial electrical distribution networks
This paper presents a variable neighborhood descent algorithm for the service restoration problem (SRP) in electrical distribution systems. The restoration problem appears when a permanent fault occurs in the system. The fault must be localized and isolated from the rest of the system. As a conseque...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/298175 |
| Acceso en línea: | http://dx.doi.org/10.1093/jigpal/jzae107 https://hdl.handle.net/11449/298175 |
| Access Level: | acceso abierto |
| Palabra clave: | electrical distribution systems metaheuristic service restoration variable neighborhood search |
| Sumario: | This paper presents a variable neighborhood descent algorithm for the service restoration problem (SRP) in electrical distribution systems. The restoration problem appears when a permanent fault occurs in the system. The fault must be localized and isolated from the rest of the system. As a consequence of the isolation, the downstream area is de-energized and requires restoration. The variable neighborhood descent algorithm features its ability to solve the SRP for radial distribution systems and introduces a strategy that helps to deal with the system's radiality. Tests are performed using a 53-node test system. The results show that the proposed algorithm can efficiently solve the SRP in a distribution system, and as a deterministic algorithm, the results can be used to help nondeterministic algorithms. |
|---|