Novel global harmony search algorithm for unconstrained problems
Date
2010
Authors
Zou, D.
Gao, L.
Wu, J.
Li, S.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Neurocomputing, 2010; 73(16-18):3308-3318
Statement of Responsibility
Conference Name
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). © 2010 Elsevier B.V.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2010 Elsevier B.V.