Economic load dispatch solution by improved harmony search with wavelet mutation
by V. Ravikumar Pandi, B.K. Panigrahi, Ankita Mohapatra, Manas Kumar Mallick
International Journal of Computational Science and Engineering (IJCSE), Vol. 6, No. 1/2, 2011

Abstract: This paper presents a new evolutionary optimisation algorithm to solve economic load dispatch (ELD) problem with operational constraints using the improved harmony search algorithm. Harmony search algorithm is a recently developed derivative-free, meta-heuristic optimisation algorithm, which draws inspiration from the musical process of searching for a perfect state of harmony. In this paper we replace the random selection process in the classical harmony search method by wavelet theory based mutation process to improve the performance of the algorithm. The proposed methodology easily takes care of solving non-convex ELD problems along with different constraints like power balance, ramp rate limits of the generators and prohibited operating zones. Simulations were performed over various standard test systems with different number of generating units and a comparative study is carried out with other existing relevant approaches. The results obtained reveal the robustness and ability of the proposed methodology over other existing techniques.

Online publication date: Wed, 18-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com