Transmission network expansion planning (TNEP) is one of the most important tasks in the field of power systems, especially in deregulated power system environments. TNEP is a nonlinear mixed integer programming problem that can be solved via hybrid heuristic algorithms. This paper presents a modified scatter search algorithm (MSSA) to reinforce the ordinary scatter search algorithm (SSA) to be equipped for handling large scale transmission expansion planning (TEP) problems. The proposed methodology is based on the SSA, incorporating some improved strategies so as to decrease the number of linear programming problems required to be solved iteratively. In this study, it is shown that the MSSA can handle TEP problems faster than the ordinary SSA, as well as other implemented algorithms. Case studies and simulation results show the significant performance of the proposed method in comparison with some studies addressed in common literature.

Transmission network expansion planning (TNEP) is one of the most important tasks in the field of power systems, especially in deregulated power system environments. TNEP is a nonlinear mixed integer programming problem that can be solved via hybrid heuristic algorithms. This paper presents a modified scatter search algorithm (MSSA) to reinforce the ordinary scatter search algorithm (SSA) to be equipped for handling large scale transmission expansion planning (TEP) problems. The proposed methodology is based on the SSA, incorporating some improved strategies so as to decrease the number of linear programming problems required to be solved iteratively. In this study, it is shown that the MSSA can handle TEP problems faster than the ordinary SSA, as well as other implemented algorithms. Case studies and simulation results show the significant performance of the proposed method in comparison with some studies addressed in common literature.