Dynamic Regional Harmony Search with Opposition and Local Learning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Dynamic Regional Harmony Search with Opposition and Local Learning


Harmony search (HS), as an emerging metaheuristic algorithm mimicking the musician's improvisation behavior, has demonstrated strong efficacy in solving various numerical and real-world optimization problems. To deal with the deficiencies in the original HS such as premature convergence and stagnation, a dynamic regional harmony search (DRHS) algorithm with opposition and local learning is proposed. DRHS utilizes opposition-based initialization, and performs independent harmony searches with respect to multiple groups created by periodically and randomly regrouping the harmony memory. Besides the traditional harmony improvisation operators, an opposition-based harmony creation scheme is used in DRHS to update each group memory. Any prematurely converged group will be restarted with its size being doubled to enhance exploration. Local search is periodically applied to exploit promising regions around topranked candidate solutions. The performance of DRHS has been evaluated and compared to the original HS using 12 numerical test problems taken from the CEC2005 benchmark. DRHS consistently outperforms HR on all test problems at both 10D and 30D.
No file

Dates and versions

hal-00780548 , version 1 (24-01-2013)



A. Kai Qin, Florence Forbes. Dynamic Regional Harmony Search with Opposition and Local Learning. GECCO'11 - 13th annual conference companion on Genetic and evolutionary computation, Jul 2011, Dublin, Ireland. pp.53-54, ⟨10.1145/2001858.2001890⟩. ⟨hal-00780548⟩
131 View
0 Download



Gmail Facebook X LinkedIn More