Advanced search
Start date

Decomposition strategy to solve the distribution system expansion planning problem

Grant number: 07/08304-8
Support Opportunities:Scholarships in Brazil - Doctorate
Effective date (Start): May 01, 2008
Effective date (End): April 30, 2012
Field of knowledge:Engineering - Electrical Engineering - Power Systems
Principal Investigator:Rubén Augusto Romero Lázaro
Grantee:John Fredy Franco Baquero
Host Institution: Faculdade de Engenharia (FEIS). Universidade Estadual Paulista (UNESP). Campus de Ilha Solteira. Ilha Solteira , SP, Brazil


This research project considers the theoretical analyses and computational implementation of two metaheuristics to the electric energy distribution system expansion planning problem.The mathematical model for the electric energy distribution system expansion planning problem considers aspects such as: building newsubstations, improve existing substations, adding new feeders in new paths, improve existing feeders, and replacement of existing feeders. A basic reliability assessment of the distribution system is carried out in the final step of the study. Two metaheuristics will be used to solve this model, a specializedtabu search algorithm and a specialized GRASP algorithm with path relinking.Additionally, a constructive heuristic algorithm to solve the distribution expansion planning problem will be developed and integrated as a basic module into the methodologies to improve the algorithm efficiency.

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Academic Publications
(References retrieved automatically from State of São Paulo Research Institutions)
BAQUERO, John Fredy Franco. Estratégia de decomposição aplicada ao problema de planejamento da expansão de sistemas de distribuição. 2012. Doctoral Thesis - Universidade Estadual Paulista (Unesp). Faculdade de Engenharia. Ilha Solteira Ilha Solteira.

Please report errors in scientific publications list by writing to: