Abstract
An Improved Harmony search algorithm (IHS) is proposed for solving multi-dimensional and multi-extremal function optimization problems. The IHS algorithm uses a common cross-operation to generate new solutions instead of the traditional improvisation mechanism presented in the basic Harmony search. The number of the new solutions varies from 1 to HMS. In each iteration, IGHS uses a one-on-one selection scheme to compare the old solutions with the new ones, and the winner will enter the next generation. Simulation results show that the proposed algorithm is more quickly and accurately to solve function optimization problems than the compared algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
