[1]TUO Shouheng,YONG Longquan,DENG Fangan.Dynamic adjustment strategy for improving the harmony search algorithm[J].CAAI Transactions on Intelligent Systems,2015,10(2):307-315.[doi:10.3969/j.issn.1673-4785.201402019]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
10
Number of periods:
2015 2
Page number:
307-315
Column:
学术论文—机器感知与模式识别
Public date:
2015-04-25
- Title:
-
Dynamic adjustment strategy for improving the harmony search algorithm
- Author(s):
-
TUO Shouheng; YONG Longquan; DENG Fang’an
-
School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723001, China
-
- Keywords:
-
adaptive adjustment strategy; high-dimensional optimization problems; harmony search algorithm
- CLC:
-
TP391
- DOI:
-
10.3969/j.issn.1673-4785.201402019
- Abstract:
-
A dynamic adjustment strategy is used to improve the harmony search algorithm for solving high-dimensional multimodal global optimization problems. It chooses the worst harmony vector from the harmony memory (HM) as an optimization objective vector. With the process of iteration, the adjustment probability of decision variables is reduced step by step. It can achieve the balance effectively between the global exploration powers and local exploitation competence, and can increase the success rate of evolution. Finally, the experimental results of 16 high-dimension benchmark functions demonstrated that the proposed method can enhance the performance and robustness of the harmony search algorithm obviously in solving large scale multimodal optimization problems.