Optimal Switching Sequence with a Specialized Tabu Search Algorithm

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorLAPSEE-
Autor(es): dc.contributorLASI-
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorPuerta, Gabriel F.-
Autor(es): dc.creatorFerreira, Marco A.-
Autor(es): dc.creatorSoares, Joao-
Autor(es): dc.creatorRomero, Ruben-
Autor(es): dc.creatorMacedo, Leonardo H.-
Data de aceite: dc.date.accessioned2025-08-21T18:50:51Z-
Data de disponibilização: dc.date.available2025-08-21T18:50:51Z-
Data de envio: dc.date.issued2025-04-29-
Data de envio: dc.date.issued2023-12-31-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1109/ISAP63260.2024.10744389-
Fonte completa do material: dc.identifierhttps://hdl.handle.net/11449/304939-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/304939-
Descrição: dc.descriptionThis paper presents a tabu search algorithm designed to address the optimal switching sequence (OSS) problem within the context of the service restoration problem (SRP) in distribution systems. The OSS problem arises when a set of switches is supposed to be operated in order to reconfigure the system's topology from an initial state to a final state. When applied in the context of the SRP, the switches suggested to be operated will partially or fully restore the disconnected loads. In this context, the main challenge is to obtain an optimal switching sequence where the energy not supplied during the entire restoration process is minimal and all the intermediate topologies are feasible. The algorithm was tested using a 53-node distribution system, and the results for the two different scenarios showed the algorithm's effectiveness in elaborating a feasible switching sequence that significantly reduces the cost of energy not supplied.-
Descrição: dc.descriptionPolytechnic of Porto GECAD LAPSEE-
Descrição: dc.descriptionIFMS LAPSEE-
Descrição: dc.descriptionPolytechnic of Porto GECAD LASI-
Descrição: dc.descriptionUNESP LAPSEE-
Descrição: dc.descriptionUNESP LAPSEE-
Idioma: dc.languageen-
Relação: dc.relation2024 22nd International Conference on Intelligent Systems Applications to Power Systems, ISAP 2024-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectDistribution network-
Palavras-chave: dc.subjectoptimal switching sequencing-
Palavras-chave: dc.subjectoptimal task scheduling-
Palavras-chave: dc.subjectservice restoration-
Palavras-chave: dc.subjecttabu search-
Título: dc.titleOptimal Switching Sequence with a Specialized Tabu Search Algorithm-
Tipo de arquivo: dc.typeaula digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.