| 分配问题的启发式算法求解 |
| |
| 引用本文： | 高毅.分配问题的启发式算法求解[J].甘肃联合大学学报(自然科学版),2009,23(3). |
| |
| 作者姓名： | 高毅 |
| |
| 作者单位： | 甘肃联合大学,信息技术中心,甘肃,兰州,730000 |
| |
| 摘 要： | 禁忌搜索算法和蚁群算法是近几年优化领域中出现的两种启发式算法.简单介绍了这两种启发式算法的基本原理,给出了应用这两种算法以及其混合算法解决分配问题的求解过程.仿真结果表明混合算法取得的结果较好.
|
| 关 键 词： | 分配问题 蚁群算法 禁忌搜索算法 混合算法 |
Research on Heuristic Algorithm for Assignment Problem |
| |
| GAO Yi.Research on Heuristic Algorithm for Assignment Problem[J].Journal of Gansu Lianhe University :Natural Sciences,2009,23(3). |
| |
| Authors: | GAO Yi |
| |
| Institution: | Information Technology Center;Gansu Lianhe University;Lanzhou 730000;China |
| |
| Abstract: | Tabu search algorithm and ant colony algorithm are heuristic algorithms which appeared in optimization domain recently.The basic principle of two algorithms are introduced briefly,the ant colony algorithm,the tabu search algorithm and the hybrid algorithm are applied to the assignment problem.The simulation results show that the hybrid algorithm performs significantly better than the ant colony algorithm and the tabu search algorithm in performance. |
| |
| Keywords: | assignment problem ant colony algorithm tabu search algorithm hybrid algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
