Opposition-Based Improved Harmony Search Algorithm Solve Unconstrained Optimization Problems

Article Preview

Abstract:

This paper develops an opposition-based improved harmony search algorithm (OIHS) for solving global continuous optimization problems. The proposed method is different from the classical harmony search (HS) in three aspects. Firstly, the candidate harmony is randomly chosen from the harmony memory or opposition harmony memory was generated by opposition-based learning, which enlarged the algorithm search space. Secondly, two key control parameters, pitch adjustment rate (PAR) and bandwidth distance (bw), are adjusted dynamically with respect to the evolution of the search process. Numerical results demonstrate that the proposed algorithm performs much better than the existing HS variants in terms of the solution quality and the stability.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

170-173

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Geem Z W, Kim J H, Loganathan G V. A new heuristic optimization algorithm: harmony search. Simulation, 2001, 76(2): 60-68.

DOI: 10.1177/003754970107600201

Google Scholar

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

DOI: 10.1016/j.amc.2006.11.033

Google Scholar

[3] H R Tizhoosh. Opposition-based Learning: A New Scheme for Machine Intelligence[C]/Proc. of International Conference on Computational Intelligence. Modeling Control and Automation. Vienna, Austria, 2005: 695- 701.

DOI: 10.1109/cimca.2005.1631345

Google Scholar

[4] S Rahnamayan, H R Tizhoosh, M M Salama. Opposition-based differential evolution. IEEE Transactions on Evolutionary Computation, 2008, 12(1): 64-79.

DOI: 10.1109/tevc.2007.894200

Google Scholar

[5] Wang Hui, Liu Y, Zeng S Y. et al. Opposition-based Particle Swarm Algorithm With Cauchy Mutation[C]/Proc. congress on Evolutionary Computation, 2007: 4750-4756.

DOI: 10.1109/cec.2007.4425095

Google Scholar

[6] H R Tizhoosh, Malisia A R. Applying Opposition-based ideas to the ant colony system[C]/Proceedings of IEEE Swarm Intelligence Symposium, 2007: 79-87.

DOI: 10.1109/sis.2007.368044

Google Scholar

[7] WANG Shen-wen, DING Li-xin XIE Da-tong et al. Group Search Optimizer Applying Opposition-based Learning [J]. Computer Science, 2012, 39(9): 183-187.

Google Scholar

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

DOI: 10.1016/j.amc.2007.09.004

Google Scholar