一种解决指派问题的蚁群算法  

Ant colony algorithm for assignment problem

作　　者：黄茹[1] 

机构地区：[1]西安邮电学院计算机系,陕西西安710061

出　　处：《西安邮电学院学报》2006年第3期106-109,共4页Journal of Xi'an Institute of Posts and Telecommunications

摘　　要：指派问题是组合优化问题的一个分支,对解决现实生活中的任务分配问题有着重要的意义。本文将指派问题表述为TSP图,使用具有局部搜索策略的蚁群算法加以解决。实验结果表明,使用具有局部搜索策略的蚁群算法解决指派问题,提高了搜索效率,能够在短时间内得到最优分配方案。Assignment problem, a kind of combinatorial optimization problem, has significant importance for real life. In this paper, we established the mathematical model of assignment problem as well as described assignment problem as a TSP diagram, then solved it by using ant colony algorithm with a local search strategy. Experiments show that, by using this algorithm, the best solution can be found rapidly.

关 键 词：指派问题 组合优化 蚁群算法 局部搜索策略 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]