Optimal network reconfigurations in distribution systems. II. Solution algorithms and numerical results
- 1 July 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Delivery
- Vol. 5 (3), 1568-1574
- https://doi.org/10.1109/61.58002
Abstract
Using a two-stage solution methodology and a modified simulated annealing technique, the authors develop a solution algorithm to the network reconfiguration problem, which is a constrained, multiobjective, nondifferentiable, optimization problem. This solution algorithm allows the designer to obtain a desirable, global noninferior point in a reasonable computation time. Also, given a desired number of switch-on/switch-off operations involved in the network configuration, the solution algorithm can identify the most effective operations. In order to reduce the computation time required, the idea of approximate calculations is explored and incorporated into the solution algorithm, where two efficient load-flow methods are employed; one for high temperature and the other for low temperature. The solution algorithm has been implemented in a software package and tested on a 69-bus system with very promising results.Keywords
This publication has 6 references indexed in Scilit:
- Optimal capacitor placements in distribution systems. I. A new formulation and the overall problemIEEE Transactions on Power Delivery, 1990
- On the existence and uniqueness of load flow solution for radial distribution power networksIEEE Transactions on Circuits and Systems, 1990
- Network reconfiguration in distribution systems for loss reduction and load balancingIEEE Transactions on Power Delivery, 1989
- Distribution feeder reconfiguration for loss reductionIEEE Transactions on Power Delivery, 1988
- Simulated Annealing: Theory and ApplicationsPublished by Springer Nature ,1987
- Optimization by Simulated AnnealingScience, 1983