You are in:Home/Publications/Social spider algorithm for solving the transmission expansion planning problem

Dr. Wael Taha Ghareeb Taha Elsayed :: Publications:

Social spider algorithm for solving the transmission expansion planning problem
Authors: W.T. Elsayed; M.S. El-Bages,
Year: 2017
Keywords: DC power flow; Generation rescheduling; Metaheuristic techniques; Transmission expansion planning; Social spider algorithm
Journal: Electric Power Systems Research
Volume: 143
Issue: Not Available
Pages: 235-243
Publisher: Elsevier
Local/International: International
Paper Link:
Full paper Not Available
Supplementary materials Not Available

In this paper, an efficient metaheuristic technique is proposed for solving the static transmission expansion planning problem. This technique is known as the social spider algorithm. A suitable methodology for handling the problem constraints is also proposed. In the proposed methodology, a DC power flow sub-problem is solved for each network resulting from adding a potential solution developed by the social spider algorithm to the base network. The proposed algorithm and the accompanying constraints handling methodology have been tested through solving the transmission expansion planning problem of three benchmark systems having 6-buses, 46 buses, and 87 buses. Excellent performance and new solutions are demonstrated in the results section. The new solutions achieve a remarkable reduction in the total investment cost.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus