On optimal multistage electric power distribution networks expansion planning

• A framework for optimal distribution systems planning is proposed.
• Imperialist competitive algorithm is adapted as optimization algorithm.
• A pseudo dynamic procedure is used for multistage planning problem.
• A sensitivity analysis used on ICA parameter and compared with GA.
• The Greedy algorithm is applied for minimum spanning problem.

The optimal expansion planning of electric power distribution network to meet system load growth and overcome to pseudo dynamic behavior of network parameters considering a large number of constraints is a hard satisfactory multiobjective optimization problem. This paper implements new developed Imperialist Competitive Algorithm (ICA) for the optimal expansion planning of distribution network. The topology of medium voltage (MV) distribution network as backbone of electric power distribution systems is designed by optimal sizing, siting and timing of medium voltage network components such as HV substation and MV feeders’ routes. A multistage expansion planning is proposed to consider dynamic behavior of the system parameters asset management and geographical constraints. In order to reach the global solution an efficient coding is developed for ICA parameters. The Greedy algorithm is used to solve the minimum spanning tree problem to construct a radial configuration of the mesh network. At each stage of the problem the results are fully illustrated either by figures or by tables. A sensitivity analysis is used to show the robustness of the results with respect to ICA parameters variation. The obtained results are compared with GA as well known heuristic optimization tool. The efficiency and capability of the methodology has been tested on an under developed relatively large-scale distribution network.