By Topic

Harmony search algorithm for transmission network expansion planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Verma, A. ; Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India ; Panigrahi, B.K. ; Bijwe, P.R.

Transmission network expansion planning (TNEP) is a very important problem in power systems. It is a mixed integer, non-linear, non-convex optimisation problem, which is very complex and computationally demanding. Various meta-heuristic optimisation techniques have been tried out for this problem. However, scope for even better algorithms still remains. In view of this, a new technique known as harmony search is presented here for TNEP with security constraints. This technique has been reported to be robust and computationally efficient compared to other meta-heuristic algorithms. Results for three sample test systems are obtained and compared with those obtained with genetic algorithm and bacteria-foraging differential evolution algorithm to verify the potential of the proposed algorithm.

Published in:

Generation, Transmission & Distribution, IET  (Volume:4 ,  Issue: 6 )