A DISCRETE IMPERIALIST COMPETITION ALGORITHM FOR TRANSMISSION EXPANSION PLANNING

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.

کلیدواژه ها:

Transmission expansion network planning (TENP) ، Discrete Imperialist Competition Algorithm (DICA) ، Optimization Technique