Improved Rerun Particle Swarm Optimization Algorithm with Harmony Search

One of the most crucial problem of the particle swarm optimization is that it can easily trap in local optima. There are some studies tried to resolve the drawback using the reset and mutation mechanism. Although it unraveled the problem well when the optimal position of benchmark function is at zeros in all dimensions. It cannot locate optima when the exact answer randomly shifted over the possible region. This study integrates Harmony Search (HS) to the rerun and reset mechanism to PSO. It performs well with selected benchmark functions, when the optimal position is randomly shifted in most of the test functions. Since it does not favor optimal point at zeroes when the optimal position is not shifted, the number of calls of the evaluation function is more than the other algorithms in some cases.