سال انتشار: ۱۳۸۹

محل انتشار: بیست و پنجمین کنفرانس بین المللی برق

تعداد صفحات: ۱۰

نویسنده(ها):

Esmaeil Abedini Duki – Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
HamidReza Abdollahi Mansoorkhani, – Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
Alireza Soroudi – Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
Mehdi Ehsan – Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran

چکیده:

This paper describes the application of a Discrete Imperialist Competition Algorithm (DICA) to deal with the solution of the Transmission Network Expansion Planning (TNEP) problem. Imperialist Competition Algorithms have demonstrated the ability to deal with non-convex, nonlinear, integermixed optimization problems, like the TNEP problem, better than a number of mathematical methodologies. Some special features with heuristic search have been added to the basic Imperialist Competition Algorithm to improve its performance in solving the TNEP problem for 6-bus Garver, IEEE 24-bus and a real-life large-scale transmission system. Results obtained reveal that ICA represents a promising approach for dealing with such a problem.