In this paper, we propose methods for minimizing power losses through dynamicreconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfigura...
详细信息
ISBN:
(纸本)9781479976959
In this paper, we propose methods for minimizing power losses through dynamicreconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfiguration cost have been developed. The first method is based on a shortest path algorithm, whereas the second one is based on mixed integer linear programming. The algorithms are tested on an IEEE network with and without distributed generation;the results are presented and compared for the two different methods.
In this paper, we propose methods for minimizing power losses through dynamicreconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfigura...
详细信息
In this paper, we propose methods for minimizing power losses through dynamicreconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfiguration cost have been developed. The first method is based on a shortest path algorithm, whereas the second one is based on mixed integer linear programming. The algorithms are tested on an IEEE network with and without distributed generation;the results are presented and compared for the two different methods.
暂无评论