Solution of combined economic and emission dispatch problems of power systems by an opposition-based harmony search algorithm

Solution of combined economic and emission dispatch problems of power systems by an opposition-based harmony search algorithm
复制标题

DOI:
10.1016/j.ijepes.2011.12.004
复制
发表时间:
2012-07-01
影响因子:
5.2
通讯作者:
Mukherjee, V.
Mukherjee, V.
中科院分区:
工程技术2区
文献类型:
--
作者:
Chatterjee, A.;Ghoshal, S. P.;Mukherjee, V.

文献摘要

被引文献

相似文献

进化算法(EAs)是处理非线性和复杂问题的众所周知的优化方法。然而,由于进化过程的缓慢,这些基于种群的算法在计算上是昂贵的。和谐搜索(HS)是一种无导数实参数优化算法。它从寻找完美和谐状态的音乐即兴创作过程中汲取灵感。本文提出了一种新的加速HS算法的方法。本文提出的基于对立的HS采用基于对立的学习进行和声记忆初始化和代跳转。在本工作中,为了提高HS的收敛速度,我们使用了相反的数。本文通过对四种标准电力系统经济与排放联合调度问题的解决方案进行广泛的比较研究,评估了所提出算法的潜力。结果证实了该算法的潜力和有效性,与其他一些算法在最近的艺术文献中浮出水面。结果表明,该算法具有较好的近似最优性和收敛速度。(C) 2012 Elsevier Ltd.版权所有。
Evolutionary algorithms (EAs) are well-known optimization approaches to deal with nonlinear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. Harmony search (HS) is a derivative-free real parameter optimization algorithm. It draws inspiration from the musical improvisation process of searching for a perfect state of harmony. This paper proposes a novel approach to accelerate the HS algorithm. The proposed opposition-based HS of the present work employs opposition-based learning for harmony memory initialization and also for the generation jumping. In the present work, opposite numbers have been utilized to improve the convergence rate of the HS. The potential of the proposed algorithm, presented in this paper, is assessed by means of an extensive comparative study of the solution obtained for four standard combined economic and emission dispatch problems of power systems. The results obtained confirm the potential and effectiveness of the proposed algorithm compared to some other algorithms surfaced in the recent state-of-the art literatures. Both the near-optimality of the solution and the convergence speed of the proposed algorithm are found to be promising. (C) 2012 Elsevier Ltd. All rights reserved.