Abstract
This paper presents a comprehensive study on mono- and multi-objective approaches for electrical distribution network design using particle swarm optimization (PSO). Specifically, two distribution network design problems, i.e., static and expansion planning, are solved using PSO. The network planning involves optimization of both network topology and branch conductor sizes. Both the planning problems are used to illustrate mono- and multi-objective optimization of distribution networks. Firstly, three PSO variants, i.e., PSO with inertia weight (PSO-IW), PSO with constriction factor (PSO-CF), and comprehensive learning PSO, are evaluated on a mono-objective (minimization of total cost of installation and energy loss) static planning problem. A novel encoding/decoding technique is devised to represent the network as a particle in PSO. Also, a heuristics based branch conductor size selection algorithm has been developed and used. Statistical tests performed to compare the performances of the three PSO variants reveal that the PSO-CF exhibits relatively better performance. Subsequently, the PSO-CF is applied for mono-objective expansion planning and multi-objective static and expansion planning problems. In the multi-objective planning with two conflicting objectives (total cost of installation and energy loss, and total non-delivered energy), the Pareto-optimality principle based tradeoff is done using the strength Pareto evolutionary algorithm-2. The efficiency of PSO for distribution system planning problem, in general, is demonstrated through different examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.