A Modified Harmony Search Algorithm Solve Numerical Optimization Problems
2014 ◽
Vol 602-605
◽
pp. 3589-3592
Keyword(s):
This paper proposes a new effective MHS algorithm to solve numerical optimization problems. The MHS algorithm first adopt a novel self-studying strategy, which makes it easy balance the global search ability and local development ability, prevent the MHS algorithm trapped into local optimal value. besides, the harmony memory consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth distance (bw) is changed with function values dynamically, it can effectively improve the convergence speed and precision of the algorithm Based on five test functions , experiments results obtained by the MHS algorithm are better than those obtained using HS, IHS and NGHS algorithm in the literature.
2014 ◽
Vol 644-650
◽
pp. 2169-2172
2014 ◽
Vol 1065-1069
◽
pp. 3438-3441
2014 ◽
Vol 587-589
◽
pp. 2295-2298
2014 ◽
Vol 989-994
◽
pp. 2532-2535
2014 ◽
Vol 989-994
◽
pp. 2528-2531
Keyword(s):
2013 ◽
Vol 4
(3)
◽
pp. 1-14
◽