network expansion studies normally offer new power lines, new substations or expansion of existing substations. they are generally proposed based on technical requirements, but financial restrictions are not considered. because of financial restrictions, ranking of network expansion plans is required. in this paper an algorithm for such ranking, based on technical and financial view points and ...

this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

Recent breakthroughs in Transmission Network Expansion Planning (TNEP) have demonstrated that the use of robust optimization, as opposed to stochastic programming methods, renders the expansion planning problem computationally tractable for real systems. State-of-the-art robust methods treat this problem as stationary throughout the study period, with all the required investments on expansion o...

this paper presents an application of benders decomposition to deal with the complexities in the simultaneous generation expansion planning (gep) and transmission expansion planning (tep). unlike the power system operation fields of study, the power system planning methods are not expected to be fast. however, it is always preferable to speed up computations to provide more analysis options for...

Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...