模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2014, Vol. 27 Issue (4): 305-312    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
Self-adapted Harmony Search Algorithm with Opposed Competition and Its Optimization
OUYANG Hai-Bin1, GAO Li-Qun 1, KONG Xian-Yong1, ZOU De-Xuan2
1.College of Information Science and Engineering, Northeastern University, Shenyang 110819
2.School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou 221116

Download: PDF (579 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A self-adapted harmony search algorithm with opposed competition (SHSOC) is proposed. The blindness of bandwidth setting of harmony search algorithm is analyzed.The adaptive bandwidth adjustment is employed. Meanwhile, the superiority of the opposed learning strategy is integrated into the proposed algorithm, and the competition selection mechanism of end elimination is established to further improve global search ability and keep the algorithm from falling into local optima. The proposed algorithm is tested on several classic functions to evaluate the performance. The numerical results show the superiority of SHSOC in accuracy and robustness compared with harmony search algorithm and some state-of-the-art harmony search variants. Moreover, SHSOC can solve the optimization problems of the heat exchanger and the speed reducer design, and the results show that SHSOC is better than any other algorithm.
Key wordsAdaptive Bandwidth Adjustment      Opposed Learning      Competition Selection      Accuracy     
Received: 18 March 2013     
ZTFLH: TP 301.6  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
OUYANG Hai-Bin
GAO Li-Qun1
KONG Xian-Yong
ZOU De-Xuan
Cite this article:   
OUYANG Hai-Bin,GAO Li-Qun1,KONG Xian-Yong等. Self-adapted Harmony Search Algorithm with Opposed Competition and Its Optimization[J]. , 2014, 27(4): 305-312.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2014/V27/I4/305
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn