A heuristic algorithm for optimal multistage sizing, siting and timing of MV distribution substations

• We modeled long-term optimal MV substation placement problem in three scenarios.
• We use Imperialist Competitive Algorithm as optimization tool to solve the problem.
• A pseudo-dynamic procedure is used for multistage planning problem.
• The algorithm is efficient with high capability especially for larger systems.
• The results are illustrated with graphical figure as well as tables for three case studies.

The electric power distribution system planning is a large-scale, complex and multi-constraint problem. Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. This paper proposes the application of an Imperialist Competitive Algorithm (ICA) for the optimal expansion planning of large distribution network, solving the optimal sizing, siting and timing of medium voltage substation. Loss characteristic matrix is introduced as a new concept in optimal substation placement problem. A step by step expansion design and planning is proposed to consider dynamic behavior of the load forecasting, asset management and geographical constraints. In order to reach the global solution, an effective coding for the ICA parameter is developed. The value of loads’ density in every site is determined by mid and long-term load forecasting program. The results show the efficiency and capability of the proposed method which has been tested on a real size distribution network.