Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (20): 5-8.

Previous Articles     Next Articles

Research and application of integer programming based on combinative harmony search and ant colony algorithm

WEI Lin1, FU Hua2, YIN Yuping2   

  1. 1.Department of Basic Education, Liaoning Technical University, Huludao, Liaoning 125105, China
    2.School of Electrical and Control Engineering, Liaoning Technical University, Huludao, Liaoning 125105, China
  • Online:2013-10-15 Published:2013-10-30

和声蚁群耦合算法求解整数规划的应用研究

魏  林1,付  华2,尹玉萍2   

  1. 1.辽宁工程技术大学 基础教学部,辽宁 葫芦岛 125105
    2.辽宁工程技术大学 电气与控制工程学院,辽宁 葫芦岛 125105

Abstract: An improved hybrid optimization algorithm based on harmony search algorithm and ant colony algorithm is proposed to?solve the general integer programming problem. The new algorithm utilizes?harmony algorithm with updating population and individual disturbance strategy to improve ant colony algorithm premature convergence, and utilizes the pheromone positive feedback effect to speed up harmony search algorithm searching optimum?paths. Experimental results show that compared to the ant colony algorithm and harmony search algorithm, the new algorithm greatly improves the general integer programming problem search efficiency.

Key words: harmony search algorithm, ant colony algorithm, pheromone, integer programming, optimum?path, premature convergence

摘要: 针对于求解一般的整数规划问题,提出了和声蚁群耦合算法。采用和声搜索更新种群策略和个体扰动策略改善了蚁群算法过早收敛的问题,同时采用蚁群算法对寻优路径信息素的正反馈来加快和声搜索收敛于最优路径。实验结果表明,相比于蚁群算法和和声搜索算法,新算法大大提高了一般整数规划问题的搜索效率。

关键词: 和声搜索算法, 蚁群算法, 信息素, 整数规划, 最优路径, 过早收敛