| 一种解决指派问题的蚁群算法 |
| |
| 引用本文： | 黄茹.一种解决指派问题的蚁群算法[J].西安邮电学院学报,2006,11(3):106-109. |
| |
| 作者姓名： | 黄茹 |
| |
| 作者单位： | 西安邮电学院,计算机系,陕西,西安,710061 |
| |
| 摘 要： | 指派问题是组合优化问题的一个分支,对解决现实生活中的任务分配问题有着重要的意义。本文将指派问题表述为TSP图,使用具有局部搜索策略的蚁群算法加以解决。实验结果表明,使用具有局部搜索策略的蚁群算法解决指派问题,提高了搜索效率,能够在短时间内得到最优分配方案。
|
| 关 键 词： | 指派问题 组合优化 蚁群算法 局部搜索策略 |
| 文章编号： | 1007-3264（2006）03-0106-04 |
| 收稿时间： | 2005-11-28 |
| 修稿时间： | 2005年11月28 |
Ant colony algorithm for assignment problem |
| |
| HUANG Ru.Ant colony algorithm for assignment problem[J].Journal of Xi'an Institute of Posts and Telecommunications,2006,11(3):106-109. |
| |
| Authors: | HUANG Ru |
| |
| Abstract: | 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. |
| |
| Keywords: | assignment problem combinatorial optimization ant colony algorithm local search strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
