Feeder‐corridor‐based distribution network planning model with explicit reliability constraints
Zihao Li, Wenchuan Wu, Boming Zhang, Xue‐Cheng Tai
Abstract
Most distribution network planning models rely on predefined candidate electric line routes (branches), i.e. the planning model is to select a subset of the candidate branches to form a network with minimal investment cost and guarantee the power supply to consumers with specified reliability. However, the manually presented candidate branch set may be thoughtless while the exhaustively generated a large set of candidate branches may make the planning model intractable. In this study, the authors propose a distribution network planning model based on feeder corridors instead of the candidate branches, since feeder corridors are commonly given in municipal planning. Based on the graph model formulated by feeder corridors, the proposed planning model can generate the network with minimal investment cost while meeting the specific reliability requirement. Furthermore, since post‐fault load restoration strategies between feeders are fully incorporated, the proposed model is applicable for mesh networks. The planning model is formulated as a mixed‐integer linear programming (MILP) problem and can be effectively solved by off‐the‐shelf software. Simulation results show the effectiveness and flexibility of the proposed method.