Letters: Novel global harmony search algorithm for unconstrained problems

  • Authors:
  • Dexuan Zou;Liqun Gao;Jianhua Wu;Steven Li

  • Affiliations:
  • School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;Division of Business University of South Australia GPO Box 2471, Adelaide, SA 5001, Australia

  • Venue:
  • Neurocomputing
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we use a recently proposed algorithm-novel global harmony search (NGHS) algorithm to solve unconstrained problems. The NGHS algorithm includes two important operations: position updating and genetic mutation with a low probability. The former can enhance the convergence of the NGHS, and the latter can effectively prevent the NGHS from being trapped into the local optimum. Based on a large number of experiments, the NGHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its two improved algorithms (IHS and SGHS).