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.
Improved Harmony Search Algorithm Integer Programming Diversity of Population
Peifeng Wu Jianhua Zhang Shuqi Li
School of Electrical and Electronic Engineering, North China Electric Power University, Beijing 1022 Factory 284 of The Second Academy of China Aerospace Science and Industry Corporation, Beijing, 1000
国际会议
the 25th Chinese Control and Decision Conference(第25届中国控制与决策会议)
贵阳
英文
409-413
2013-05-01(万方平台首次上网日期,不代表论文的发表时间)