.png){kind=icon}
.png){kind=icon}
Return
Approximating electrical distribution networks via mixed-integer nonlinear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2010.08.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given urban data derived from a geographical information system (GIS), we consider the problem of constructing an estimate of the electrical distribution system of an urban area. We employ the image data to obtain an approximate electrical load distribution over a network of a prespecificed discretization. Together with partial information about existing substations, we determine the optimal placement of electrical substations to sustain such a load that minimizes the cost of capital and losses. This requires solving large-scale quadratic programs with discrete variables for which we present a novel penalization-smoothing scheme. The choice of locations allows one to determine the optimal flows in this network, as required by physical requirements which provide us with an approximation of the distribution network. Furthermore, the scheme allows for approximating systems in the presence of no-go areas, such as lakes and fields. We examine the performance of our algorithm on the solution of a set of location problems and observe that the scheme is capable of solving large-scale instances, well beyond the realm of existing mixed-integer nonlinear programming solvers. We conclude with a case study in which a stage-wise extension of this scheme is developed to reflect the temporal evolution of load. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Optimization
Nonlinear programming
Mixed-integer nonlinear programming
Distribution system design
GIS
Journal
I
IF:
5
Papers:
1.1W
Citations:
3.1W
