Efficient Multi-start with Path Relinking Search Strategy for Transmission System Expansion Planning

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorSilva, Silvia M. L.-
Autor(es): dc.creatorFaria, Lucas Teles-
Autor(es): dc.creatorRomero, Ruben-
Autor(es): dc.creatorFranco, John F.-
Data de aceite: dc.date.accessioned2025-08-21T15:34:53Z-
Data de disponibilização: dc.date.available2025-08-21T15:34:53Z-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2020-12-31-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1109/ACCESS.2021.3127369-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/231552-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/231552-
Descrição: dc.descriptionTransmission expansion planning is a complex problem that deals with the selection of new transmission lines that guarantee meeting future demand/generation and technical limits with the minimal investment cost. The transmission expansion planning problem has been solved through approaches and techniques aimed at reducing the computational effort required for its solution. Nevertheless, finding the optimal solution or even good-quality solutions for large-scale transmission systems is still challenging. In that context, an efficient multi-start with path relinking search strategy for the transmission expansion planning problem is proposed. The proposed strategy has two phases: constructive phase and local search. In the former, the multi-start applies a diversification process to guide the search along different regions to obtain good-quality solutions. Then, the local search phase executes an intensive search in the neighborhood of the best feasible solutions found in the constructive phase. The intensification process is performed in two steps: application of the Villasana-Garver-Salon algorithm in the best solutions after consecutive removal of transmission lines and path relinking using elite solution pairs. Tests performed using data from four systems show the efficiency of the proposed search strategy. Thus, the optimal solutions were obtained with a very low computational effort.-
Descrição: dc.descriptionDepartment of Electrical Engineering, São Paulo State University, Ilha Solteira, SP 15385000, Brazil.-
Descrição: dc.descriptionSchool of Energy Engineering, São Paulo State University, Rosana, SP 19274000, Brazil.-
Descrição: dc.descriptionDepartment of Electrical Engineering, São Paulo State University, Ilha Solteira, SP 15385000, Brazil. (e-mail: ruben.romero@unesp.br)-
Descrição: dc.descriptionDepartment of Electrical Engineering, São Paulo State University, Ilha Solteira, SP 15385000, Brazil and School of Energy Engineering, São Paulo State University, Rosana, SP 19274000, Brazil.-
Idioma: dc.languageen-
Relação: dc.relationIEEE Access-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectGenetic algorithms-
Palavras-chave: dc.subjectMathematical models-
Palavras-chave: dc.subjectMulti-start Metaheuristic (MSM)-
Palavras-chave: dc.subjectPath Relinking (PR)-
Palavras-chave: dc.subjectPlanning-
Palavras-chave: dc.subjectPower System Optimization-
Palavras-chave: dc.subjectPower transmission lines-
Palavras-chave: dc.subjectProposals-
Palavras-chave: dc.subjectSearch problems-
Palavras-chave: dc.subjectTransmission Expansion Planning (TEP)-
Palavras-chave: dc.subjectUncertainty-
Título: dc.titleEfficient Multi-start with Path Relinking Search Strategy for Transmission System Expansion Planning-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.