首页 | 本学科首页   官方微博 | 高级检索  
     

和声蚁群耦合算法求解整数规划的应用研究
引用本文:魏林,付华,尹玉萍. 和声蚁群耦合算法求解整数规划的应用研究[J]. 计算机工程与应用, 2013, 49(20): 5-8
作者姓名:魏林  付华  尹玉萍
作者单位:1.辽宁工程技术大学 基础教学部,辽宁 葫芦岛 1251052.辽宁工程技术大学 电气与控制工程学院,辽宁 葫芦岛 125105
基金项目:国家自然科学基金(No.51274118)。
摘    要:针对于求解一般的整数规划问题,提出了和声蚁群耦合算法。采用和声搜索更新种群策略和个体扰动策略改善了蚁群算法过早收敛的问题,同时采用蚁群算法对寻优路径信息素的正反馈来加快和声搜索收敛于最优路径。实验结果表明,相比于蚁群算法和和声搜索算法,新算法大大提高了一般整数规划问题的搜索效率。

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

Research and application of integer programming based on combinative harmony ;search and ant colony algorithm
WEI Lin , FU Hua , YIN Yuping. Research and application of integer programming based on combinative harmony ;search and ant colony algorithm[J]. Computer Engineering and Applications, 2013, 49(20): 5-8
Authors:WEI Lin    FU Hua    YIN Yuping
Affiliation:1.Department of Basic Education, Liaoning Technical University, Huludao, Liaoning 125105, China2.School of Electrical and Control Engineering, Liaoning Technical University, Huludao, Liaoning 125105, China
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.
Keywords:harmony search algorithm  ant colony algorithm  pheromone  integer programming  optimum path  premature convergence
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号