期刊
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
卷 64, 期 -, 页码 293-299出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.ijepes.2014.06.076
关键词
Distribution system reconfiguration; Planar graph; Dual graph; Minimum spanning tree; Radiality constraint; Mixed-integer programming
资金
- National Science and Engineering Research Council (NSERC) of Canada
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据