DocumentCode
2101395
Title
A hybrid simplex-harmony search algorithm and its application to model reduction of linear systems
Author
Peng Cheng ; Wang Yong
Author_Institution
Dept. of Autom., Univ. of Sci. & Technol. of China, Hefei, China
fYear
2010
fDate
29-31 July 2010
Firstpage
5272
Lastpage
5275
Abstract
To improve the local search ability of the basic harmony search algorithm, a hybrid algorithm that combines harmony search algorithm and concurrent simplex method is proposed. The performance of the hybrid simplex-harmony search algorithm is investigated and compared with the basic harmony search algorithm and two other heuristics through benchmark function optimization problems. The hybrid algorithm is then used to solve the model reduction problems. Simulation results demonstrate the effectiveness of the proposed hybrid algorithm.
Keywords
linear systems; optimisation; reduced order systems; search problems; benchmark function; concurrent simplex method; hybrid simplex harmony search algorithm; linear system; model reduction; optimization; Algorithm design and analysis; Computational modeling; Heuristic algorithms; Optimization; Reduced order systems; Search problems; Harmony Search; Model Reduction; Simplex Method;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2010 29th Chinese
Conference_Location
Beijing
Print_ISBN
978-1-4244-6263-6
Type
conf
Filename
5573200
Link To Document