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

Full description

Saved in:
Bibliographic Details
Published in:Computer methods in applied mechanics and engineering Vol. 197; no. 33; pp. 3080 - 3091
Main Authors: Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., Alizadeh, Y.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.06.2008
Elsevier
Subjects:
ISSN:0045-7825, 1879-2138
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0045-7825
1879-2138
DOI:10.1016/j.cma.2008.02.006