Two improved harmony search algorithms for solving engineering optimization problems

This paper describes two new harmony search (HS) meta-heuristic algorithms for engineering optimization problems with continuous design variables The key difference between these algorithms and traditional (HS) method is in the way of adjusting bandwidth (bw). bw is very important factor for the high efficiency of the harmony search algorithms and can be potentially useful in adjusting convergence rate of algorithms to optimal solution First algorithm, proposed harmony search (PHS), introduces a new definition of bandwidth (bw). Second algorithm, improving proposed harmony search (IPHS) employs to enhance accuracy and convergence rate of PUS algorithm In IPHS, non-uniform mutation operation is introduced which is combination of Yang bandwidth and PHS bandwidth. Various engineering optimization problems, including mathematical function minimization problems and structural engineering optimization problems, are presented to demonstrate the effectiveness and robustness of these algorithms In all cases, the solutions obtained using IPHS are in agreement or better than those obtained from other methods (C) 2010 Elsevier B V All rights reserved