| 二次指派问题的蚁群算法研究 |
| |
| 引用本文： | 尹晓峰,刘春煌.二次指派问题的蚁群算法研究[J].铁道运输与经济,2005,27(5):68-70. |
| |
| 作者姓名： | 尹晓峰 刘春煌 |
| |
| 作者单位： | 铁道科学研究院,电子计算技术研究所,北京,100081 |
| |
| 摘 要： | 蚁群算法是受自然界蚂蚁觅食过程中,基于信息素的最短路径搜索食物行为启发,提出的一种智能优化算法。在采用蚁群算法求解二次指派问题中,针对蚁群算法存在的过早收敛问题,使用距离及流量作为启发式信息并引入局部优化,对蚁群算法的结果加以改进,计算机仿真结果表明,蚁群算法对求解二次指派问题有较好的效果。
|
| 关 键 词： | 蚁群算法 组合优化 二次指派问题 混合算法 研究 |
| 文章编号： | 1003-1421(2005)05-0068-03 |
| 修稿时间： | 2004年12月29 |
Study of Ant Colony Algorithm for Second Assignment Issue |
| |
| YIN Xiao-feng,LIU Chun-huang.Study of Ant Colony Algorithm for Second Assignment Issue[J].Rail Way Transport and Economy,2005,27(5):68-70. |
| |
| Authors: | YIN Xiao-feng LIU Chun-huang |
| |
| Abstract: | Ant Colony Algorithm (ACA) is an intelligence-optimized algorithm coming from the illumination of food-seeking behavior by ants based on the shortest route of daumone. During the calculation of second assignment issue with ACA, regarding the too early converge problem, the distance and flow are used as heuristic information and local optimization is introduced to consummate the result of ACA. The computer simulation result shows that ACA gives a good effect in solving second assignment issue. |
| |
| Keywords: | Ant Colony Algorithm integrated optimization second assignment issue combined algorithm study |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
