2010
DOI: 10.1002/eej.21015
|View full text |Cite
|
Sign up to set email alerts
|

A multibranch exchange method for distribution loss minimization

Abstract: SUMMARYThis paper presents a multibranch exchange method for reconfiguration of distribution systems to reduce their line losses. In this method several switches are closed and opened simultaneously in each branch exchange operation to expand the search neighborhood. The switches to be closed are selected as the intermediate systems will be meshed configuration. Sequential branch opening method can be applied to open the switches to obtain the radial configuration efficiently. Test examples show the effectiven… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…It means that a parent is selected, one of PG operators is randomly selected and applied to the parent, and an offspring is created in each iteration. Total active power loss in (3) has been considered as the objective function, which is multiplied by the penalty term in (4) for individuals in the infeasible SP. The objective function has to be minimized through the network reconfiguration.…”
Section: Ea Using Pg Operatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…It means that a parent is selected, one of PG operators is randomly selected and applied to the parent, and an offspring is created in each iteration. Total active power loss in (3) has been considered as the objective function, which is multiplied by the penalty term in (4) for individuals in the infeasible SP. The objective function has to be minimized through the network reconfiguration.…”
Section: Ea Using Pg Operatorsmentioning
confidence: 99%
“…However, their method is capable of finding only local optima, and the final solution heavily depends on the initial configuration [2]. Murai et al [3] proposed an advanced branch-exchange method that closes N switches and thus creates N intermediate loops in each iteration, where N is not necessarily equal to the total number of loops. Then, the loops are opened by opening N switches while performing a local search for finding the proper switches to open in each iteration.…”
Section: Introductionmentioning
confidence: 99%