A New Variant Harmony Search Algorithm with Random Mutation Strategy
2014 ◽
Vol 1065-1069
◽
pp. 3425-3428
Keyword(s):
Harmony search (HS) algorithm is a good meta-heuristic intelligent optimization method, which has been paid much attention recently. However, intelligent optimization methods are easily trapped into local optima, HS is no exception. In order to improve the performance of HS, a new variant of harmony search algorithm with random mutation strategy (HSRM) is proposed in this paper. The HSRM uses a random mutation strategy to replace the pitch adjusting operation, and dynamically adjust the key parameter pitch adjusting rate (PAR). Experiment results demonstrated that the proposed method is superior to the HS and recently developed variants (IHS, and GHS) and other meta-heuristic algorithm.
2013 ◽
Vol 415
◽
pp. 353-356
◽
2013 ◽
Vol 365-366
◽
pp. 174-177
2014 ◽
Vol 1065-1069
◽
pp. 3438-3441
2014 ◽
Vol 644-650
◽
pp. 2173-2176
2018 ◽
Vol 13
(06)
◽
pp. 86
2008 ◽
Vol 29
(4)
◽
pp. 391-410
◽
2011 ◽
Vol 225-226
◽
pp. 1100-1104
◽
2006 ◽
Vol 324-325
◽
pp. 1293-1296
◽