Abstract
This study presents a simple and fast strategy for selecting the candidate solutions of the distribution system reconfiguration problem without solving optimization based or load flow based programs. It consists of constructing a node-node adjacency matrix of the original network topology in which specific diagonal entries corresponding to the off-diagonal ones represent the favourable candidate solutions. This strategy needs only primitive network information and is applicable to any optimization method and network dimension without affecting the computational tractability of the problem. Through numerical experiments on various test systems, the efficacy of the proposed scheme is illustrated.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call