Optimal network reconfigurations in distribution systems. Part 2; Solution algorithms and numerical results

Journal Article · Sun Jul 01 04:00:00 EDT 1990 · IEEE Transactions on Power Delivery (Institute of Electrical and Electronics Engineers); (USA)

DOI:https://doi.org/10.1109/61.58002· OSTI ID:6473950

Chiang, H D; Jean-Jumeau, R ^[1]

---

1. Cornell Univ., Ithaca, NY (USA). School of Electrical Engineering

In this paper, based on 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, multi-objective, non-differentiable optimization problem. This solution algorithm allows the designer to obtain a desirable, global non-inferior point in a reasonable computation time. Also, given a desired number of switch-on/switch-off operations involved in the network reconfiguration, the solution algorithm can identify the most effective operations. In order to speed up 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.

• OSTI ID: 6473950
• Journal Information: IEEE Transactions on Power Delivery (Institute of Electrical and Electronics Engineers); (USA), Journal Name: IEEE Transactions on Power Delivery (Institute of Electrical and Electronics Engineers); (USA) Vol. 5; ISSN 0885-8977; ISSN ITPDE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTER ARCHITECTURE
COMPUTER CODES
COMPUTER NETWORKS
DATA TRANSMISSION SYSTEMS
DESIGN
MATHEMATICAL LOGIC
OPTIMIZATION