Opposition-based learning in global harmony search algorithm

被引：0

作者：

Zhai J.-C. ^{[1
]}

Qin Y.-P. ^{[2
]}

机构：

[1] College of Information Science and Technology, Bohai University, Jinzhou

[2] College of Engineering, Bohai University, Jinzhou

来源：

Kongzhi yu Juece/Control and Decision | 2019年 / 34卷 / 07期

关键词：

Back tracking; Harmony search; Local optimum; Mutation; Opposition based learning; Random learning;

D O I：

10.13195/j.kzyjc.2017.1743

中图分类号：

学科分类号：

摘要：

This paper proposes an opposition-based learning global harmony search (OLGHS) algorithm. An oppositionbased learning initialization technique is employed for initialize the harmony memory to enhance the quality of the initial harmony vector. The worst harmony learns from the best harmony, which can improve the global search performance of the algorithm. The local search performance of the algorithm is enhanced by means of random learning strategy of backtracking interaction among other harmony vectors. The new harmony is dynamically generated by means of random global crossover with two different learning strategies, and the harmony memory is updated by the optimal individual of the improvising harmony and its opposition harmony. Finally, a comparison test with other heuristic optimization algorithms and HS variants is carried out to test the optimization performance of the proposed algorithm. The simulation results demonstrate the OLGHS algorithm has higher convergence precision and convergence rate. © 2019, Editorial Office of Control and Decision. All right reserved.

引用

页码：1449 / 1455

页数：6

共 20 条

[11]

Ouyang H., Gao L., Kong X., Hybrid harmony search particle swarm optimization with global dimension selection, Information Sciences, 346, pp. 318-337, (2016)

[12]

Zhao S.Z., Suganthan P.N., Pan Q.K., Dynamic multi-swarm particle swarm optimizer with harmony search, Expert Systems with Applications, 38, 4, pp. 3735-3742, (2011)

[13]

Bansal P., Sabharwal S., Mittal N., A hybrid artificial bee colony and harmony search algorithm to generate covering arrays for pair-wise testing, Int J of Intelligent Systems and Applications, 9, 8, pp. 59-70, (2017)

[14]

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

[15]

Zou D., Gao L., Wu J., Novel global harmony search algorithm for unconstrained problems, Neurocomputing, 73, 16, pp. 3308-3318, (2010)

[16]

Valian E., Tavakoli S., Mohanna S., An intelligent global harmony search approach to continuous optimization problems, Applied Mathematics and Computation, 232, pp. 670-684, (2014)

[17]

Khalili M., Kharrat R., Salahshoor K., Global dynamic harmony search algorithm: GDHS, Applied Mathematics and Computation, 228, pp. 195-219, (2014)

[18]

Guo Z., Wang S., Yue X., Global harmony search with generalized opposition-based learning, Soft Computing, 21, 8, pp. 2129-2137, (2017)

[19]

Ouyang H., Gao L., Li S., Improved harmony search algorithm: LHS, Applied Soft Computing, 53, pp. 133-167, (2017)

[20]

Tizhoosh H.R., Opposition-based learning: A new scheme for machine intelligence, Int Conf on Computational Intelligence for Modelling, Control and Automation and Int Conf on Intelligent Agents, Web Technologies and Internet Commerce, pp. 695-701, (2005)

← 1 2 →