Journal
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
Volume 64, Issue -, Pages 293-299Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.ijepes.2014.06.076
Keywords
Distribution system reconfiguration; Planar graph; Dual graph; Minimum spanning tree; Radiality constraint; Mixed-integer programming
Categories
Funding
- National Science and Engineering Research Council (NSERC) of Canada
Ask authors/readers for more resources
Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available