You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/74218
Title: 
Optimal conductor size selection and reconductoring in radial distribution systems using a mixed-integer LP approach
Author(s): 
Institution: 
Universidade Estadual Paulista (UNESP)
ISSN: 
0885-8950
Abstract: 
This paper presents a mixed-integer linear programming model to solve the conductor size selection and reconductoring problem in radial distribution systems. In the proposed model, the steady-state operation of the radial distribution system is modeled through linear expressions. The use of a mixed-integer linear model guarantees convergence to optimality using existing optimization software. The proposed model and a heuristic are used to obtain the Pareto front of the conductor size selection and reconductoring problem considering two different objective functions. The results of one test system and two real distribution systems are presented in order to show the accuracy as well as the efficiency of the proposed solution technique. © 1969-2012 IEEE.
Issue Date: 
1-Jan-2013
Citation: 
IEEE Transactions on Power Systems, v. 28, n. 1, p. 10-20, 2013.
Time Duration: 
10-20
Keywords: 
  • Distribution system optimization
  • Mixed-integer linear programming
  • Optimal conductor size selection
  • Distribution systems
  • Linear expression
  • Mixed integer linear programming
  • Mixed-integer
  • Objective functions
  • Optimality
  • Optimization software
  • Pareto front
  • Radial distribution systems
  • Re-conductoring
  • Real distribution
  • Size selection
  • Solution techniques
  • Steady-state operation
  • Test systems
  • Integer programming
  • Local area networks
  • Optimization
Source: 
http://dx.doi.org/10.1109/TPWRS.2012.2201263
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/74218
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.