A Modified Harmony Search Algorithm Solve Numerical Optimization Problems

Article Preview

Abstract:

This paper proposes a new effective MHS algorithm to solve numerical optimization problems. The MHS algorithm first adopt a novel self-studying strategy, which makes it easy balance the global search ability and local development ability, prevent the MHS algorithm trapped into local optimal value. besides, the harmony memory consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth distance (bw) is changed with function values dynamically, it can effectively improve the convergence speed and precision of the algorithm Based on five test functions , experiments results obtained by the MHS algorithm are better than those obtained using HS, IHS and NGHS algorithm in the literature.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3589-3592

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J.H. Holland, Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, (1975).

Google Scholar

[2] Fred Glover, Harvey J. Greenberg. New approaches for heuristic search: A bilateral linkage with artificial intelligence. European Journal of Operational Research 1989, 39(2): 119-130.

DOI: 10.1016/0377-2217(89)90185-9

Google Scholar

[3] S. Kirkpatrick, C. Gelatt, M. Vecchi. Optimization by simulated annealing. Science 220, 1983, 671-680.

DOI: 10.1126/science.220.4598.671

Google Scholar

[4] M. Dorigo, V. Maniezzo, A. Golomi, Ant system: optimization by a colony of cooperation agents, IEEE Transactions on SMC, 1996, 26(1): 29-41.

Google Scholar

[5] J. Kennedy. R. C. Eberhart. Particle swarm optimization, in: Proceeding of IEEE International Conference on Neural Networks, 1995, 1942-(1948).

Google Scholar

[6] R. storn, Differential evolution design of an IIR-filter, in: IEEE International Conference on Evolutionary Computation, Nagoya, 1996, 268-273.

DOI: 10.1109/icec.1996.542373

Google Scholar

[7] Mahdavi M, Fesanghary M, Damangir E. An improved harmony search algorithm for solving optimization problems [J], Applied Mathematics and Computation, 2007, 188(2): 1567–1579.

DOI: 10.1016/j.amc.2006.11.033

Google Scholar

[8] Omran M G H, Mahdavi M. Global-best harmony search [J], Applied Mathematics and Computation, 2008, 198(2): 643-656.

DOI: 10.1016/j.amc.2007.09.004

Google Scholar