Solving integer programming problems by an improved harmony search algorithm

Inspired by the search method of harmony search algorithms, we propose an other version of improved harmony search(IHS)algorithm to solve integer programming problems. This paper designs a novel improvising strategy which is beneficial to the convergence of algorithm in the early stage of iteration and increasing the diversity of population in the late stage of iteration. Experimental results show that the proposed algorithm can be an efficient alternative for solving integer programming problems.