二次指派问题的蚁群算法研究  

Study of Ant Colony Algorithm for Second Assignment Issue

作　　者：尹晓峰[1] 刘春煌[1] 

机构地区：[1]铁道科学研究院电子计算技术研究所,北京100081

出　　处：《铁道运输与经济》2005年第5期68-70,共3页Railway Transport and Economy

摘　　要：蚁群算法是受自然界蚂蚁觅食过程中,基于信息素的最短路径搜索食物行为启发,提出的一种智能优化算法。在采用蚁群算法求解二次指派问题中,针对蚁群算法存在的过早收敛问题,使用距离及流量作为启发式信息并引入局部优化,对蚁群算法的结果加以改进,计算机仿真结果表明,蚁群算法对求解二次指派问题有较好的效果。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.

关 键 词：二次指派问题 蚁群算法 信息素 过早收敛问题 使用距离 流量 工作原理 混合算法 智能优化算法 

分 类 号：O242.23[理学—计算数学]