کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
499756 863058 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
چکیده انگلیسی

This study presents a hybrid harmony search algorithm (HHSA) to solve engineering optimization problems with continuous design variables. Although the harmony search algorithm (HSA) has proven its ability of finding near global regions within a reasonable time, it is comparatively inefficient in performing local search. In this study sequential quadratic programming (SQP) is employed to speed up local search and improve precision of the HSA solutions. Moreover, an empirical study is performed in order to determine the impact of various parameters of the HSA on convergence behavior. Various benchmark engineering optimization problems are used to illustrate the effectiveness and robustness of the proposed algorithm. Numerical results reveal that the proposed hybrid algorithm, in most cases is more effective than the HSA and other meta-heuristic or deterministic methods.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Methods in Applied Mechanics and Engineering - Volume 197, Issues 33–40, 1 June 2008, Pages 3080–3091
نویسندگان
, , , ,