View article

Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable harmony. It has been used to solve various optimization problems and shown to produce good results for many problems. However, harmony search algorithm has slow convergence that might decrease its efficiency in producing good quality solutions for constrained optimization problems. In order to overcome this shortcoming, we propose a hybrid harmony search algorithm that integrates a local search algorithm and harmony search algorithm to increase its exploitation process and to further improve the generated solution. Three well-known local search algorithms: hill climbing, simulated annealing, and reactive tabu search are hybridized with the harmony search algorithm. The proposed algorithm is tested on the standard public Solomon's vehicle routing problem with …