Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Abstract—This paper presents how the application of the min- actions on the switching elements without altering the system
imal loss reconfiguration in distribution networks can help to eval- radiality. Many papers proposed then modifications which im-
uate online reconfiguration benefits, considering the time varying proved accuracy and computational efficiency of this method
nature of loads, using daily load profiles in each node of the system.
The emphasis in this evaluation is hourly reconfiguration in dis- [3].
tribution systems, compared to fixed topologies, considering max- There are other works proposing optimization techniques
imum and average demand of the system. The results of applica- such as expert system, modified simulated annealing, genetic
tions to two real systems show unexpectedly that hourly reconfig- algorithms, and artificial neural networks [4]–[7]. Algorithms
uration is not so effective, if compared to a simple maximum or of transport with quadratic costs [8] and heuristic methods have
average demand reconfiguration. These conclusions are based on
the decrease of obtained losses and on the amount of commutations also been proposed [9]–[14]. A survey on distribution systems
involved in the hourly reconfiguration process. reconfiguration is presented in [15], ranging from Merlin and
Back fundamental work, to the state of art in 1993. Reference
Index Terms—Distribution networks, losses, reconfiguration,
variability demand. [16] obtained loss minimization by installing capacitors and
by network reconfiguration considering load modeling impact.
An algorithm that is based on distribution network partitioning
NOMENCLATURE into groups of load busses is proposed in [17]. A heuristic
Resistance of branch “b”. constructive method for minimal losses reconfiguration is
Complex current in branch “b”. proposed in [18]. By means of a loss incremental evaluation,
i Current vector of branches. a new node is added in each stage that introduces minimal
Maximum current of branches. losses. Finally, [19] presented an algorithm for minimal loss
I Vector of node currents. reconfiguration, based on dynamic programming approach.
[A] Incidence matrix. This algorithm, based on formal technique, is quite simple, and
V Node voltage. results in a very short computing time. Therefore, it opens a
Minimum node voltage. way to real time reconfiguration of networks.
Maximum node voltage. The main objective of this paper is to take into account how
Number of total branches. load varies in distribution systems, depending on the season, on
M Branch number of radial network. the day, and on the hour. The switching actions to reduce losses
N Number of nodes. take into account the time varying nature of loads. The load
Number of sources. profiles are a function of customer types and they vary from
one connection point to another one all over the network. Thus,
I. INTRODUCTION the load diversity is taken into account by the daily demands of
various customer types.
model itself (P, Z, or I constant), the actual type of load (indus- ix) Radial systems: The process goes on until all loads are
trial, commercial, residential, and mixed), and hourly variation connected to the network; if not, they all go to iv).
[24], [25]. The aim is to evaluate online reconfiguration benefit x) Final loss evaluation: A fast radial load flow is applied
in terms of loss reduction. to determine network’s final losses.
TABLE I
REAL SYSTEMS CHARACTERISTICS
TABLE II
LOAD TYPE IN REAL SYSTEMS
V. RESULTS
Results obtained for system 1 are presented in Table III. They
Fig. 3. Industrial load.
show hourly loss for actual operational condition, online loss,
for hourly minimal loss reconfiguration. Then, hourly losses are
evaluated for the topology obtained for maximum demand oper-
ational condition. Table III also shows loss percentage reduction
in respect to the actual configuration. Fig. 5 shows loss evolu-
tion for the system 1.
Table IV, like in the previous case, shows results for system
2. It presents hourly losses for the actual operational conditions,
losses obtained when hourly reconfiguration is applied (consid-
ering the online minimization), and hourly losses maintaining
topology obtained at maximum demand and at average demand.
Fig. 4. Public light. Fig. 6 shows system 2, hourly loss behavior.
Table V presents the number of necessary commutations for
hourly reconfigurations in system 2. Finally, Table VI shows the
i) actual configuration—it corresponds to the hourly loss
number of necessarycommutations foraverage demand reconfig-
evaluation, in a period of 24 h, using the actual network
uration and maximum demand reconfiguration in the system 2.
configurations;
ii) hourly configuration—it finds optimal topology and as-
sociated losses, for each one of the 24-h intervals, in VI. RESULT ANALYSIS
function of the different hourly demand profiles of the Table III shows an important loss reduction when hourly re-
systems. configuration is made. The maximum loss reduction is 0,0452
iii) configuration for maximum demand—in this case, the p.u., corresponding to 52% (0.0875 p.u. at 0.0423 p.u, hour 12)
optimal topology is determined for the maximum de- and the minimal loss reduction is 0,0097 p.u. and corresponds to
mand condition of each node. Later on, maintaining this 48% (0.0204 p.u. at 0.0107 p.u, hour 3). In case of loss evalua-
topology, the loss behavior for the 24 h, in function of tion for the topology of maximum demand, there is a loss reduc-
hourly load profiles in each node is analyzed. tion similar to the previous case (52% in hour 9), but in the case
552 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 19, NO. 1, FEBRUARY 2004