Abstract
Sectionalizing switches (SSs) and tie lines play essential roles in reducing the duration of customer interruptions in electricity distribution networks. The effectiveness of such assets is strongly influenced by their placement in the grid. Operation of SSs and tie lines is also inherently interdependent. Due to the structural complexities regarding the mathematical modeling of such dependencies, optimization of the planning and operation of switches and tie lines has typically required either leveraging heuristic and metaheuristic approaches or oversimplifying the network topology. To tackle such issues, this paper presents a computationally-efficient model for reliability-oriented concurrent switch and tie line placement in distribution networks with complex topologies. The proposed model can be applied to grids with several tie lines and laterals per feeder, and yields the optimal location of tie lines, type of tie switches, namely manual or remote-controlled, and the location and type of SSs. Being cast as a mixed integer linear programming (MILP) problem, the model can be efficiently solved with guaranteed convergence to global optimality using off-the-shelf optimization software. The efficiency and scalability of the proposed model are demonstrated through implementation on five networks and the outcomes are thoroughly discussed.
Highlights
I N today’s world, electrical energy plays such a vital role in our everyday life that even short service interruptions have become intolerable
A novel approach has been presented for optimizing the concurrent placement of sectionalizing switches (SSs) and tie lines in the distribution networks with complex topologies
To pragmatically account for the reliability-oriented costs, a reliability incentive regulation in terms of a reward-penalty scheme based on system average interruption duration index (SAIDI) as well as the revenue lost due to undelivered energy to the endusers, estimated based on EENS, were considered
Summary
I N today’s world, electrical energy plays such a vital role in our everyday life that even short service interruptions have become intolerable. Galias in [31] addressed this drawback of the MILP switch optimization problem, utilizing tree-structure based algorithms to find the allocation of a given number of SSs in a radially operated DN Their method was very fast, the approach could not guarantee the convergence to the global optimum in every case and did not consider the existence of tie lines in the DN, let alone optimizing them. As the formulation is developed in an MILP fashion, it can be readily solved by offthe-shelf solvers in a finite amount of time, while guaranteeing convergence to the global optimal solution In this method, prior to the switch and tie line optimization, a preprocessing procedure is carried out so as to specify the minimal possible restoration scenarios in the case of every feeder section failure for each load node. The main contributions of this study are as follows:
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
