摘要
指派是现实生活中经常遇到的一类问题,文章建立了指派问题的数学模型,并用具有变异特征的蚁群算法对其加以解决。蚁群算法是一种进化算法,适合解决组合优化问题,指派问题是组合优化问题中的一个分支。实验结果表明,使用变异蚁群算法解决指派问题,提高了搜索效率,能够在短时间内得到最优分配方案。
Assignment problem, a kind of combinatorial optimization problem, has significant importance for real life. Ant system algorithm is a kind of evolutionary algorithms, which is efficient in solving combinatorial optimization problem. In this paper, we established the mathematical model of assignment problem as well as solved this problem by mutated ant colony algorithm. Experiments show that, by using this algorithm, the best solution can be found rapidly.
出处
《微电子学与计算机》
CSCD
北大核心
2005年第6期80-83,共4页
Microelectronics & Computer
基金
陕西省"十五"科技攻关项目(2000K08-G12)
关键词
指派问题
组合优化
蚁群算法
变异
Assignment problem, Combinatorial optimization, Ant colony algorithm, Mutation
