کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
412733 679678 2010 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Novel global harmony search algorithm for unconstrained problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Novel global harmony search algorithm for unconstrained problems
چکیده انگلیسی

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).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 73, Issues 16–18, October 2010, Pages 3308–3318
نویسندگان
, , , ,