|
|||||
|
|
| 蚁群算法解决指派问题的研究和应用 | |
| 引用本文： | 殷人昆,吴阳,张晶炜.蚁群算法解决指派问题的研究和应用[J].计算机工程与科学,2008,30(4):43-45. |
| 作者姓名： | 殷人昆 吴阳 张晶炜 |
| 作者单位： | 1. 清华大学计算机系,北京,100084 2. 中科院研究生院,北京,100049;军后勤技术装备研究所,北京,100072 3. 军后勤技术装备研究所,北京,100072;海军航空工程学院信息融合技术研究所,山东,烟台,264001 |
| 摘 要： | 指派问题是在生产和生活中经常出现的问题。本文建立了指派问题的数学模型，对现有的解决指派问题的蚁群算法进行了分析，并设计了一种改进的解决指派问题的蚁群算法，有效地提高了蚁群算法解决指派问题的准确性和效率，并通过实验结果验证了应用蚁群算法解决指派问题的可行性和先进性。 |
| 关 键 词： | 蚁群算法 指派问题 组合优化 匈牙利法 |
| 文章编号： | 1007-130X(2008)04-0043-03 |
| 修稿时间： | 2007年9月1日 |
Research and Application of the Ant Colony Algorithm in the Assignment Problem |
|
| YIN Ren-kun,WU Yang,ZHANG Jing-wei.Research and Application of the Ant Colony Algorithm in the Assignment Problem[J].Computer Engineering & Science,2008,30(4):43-45. | |
| Authors: | YIN Ren-kun WU Yang ZHANG Jing-wei |
| Abstract: | The assignment problem is a very important one that frequently appears in mass production and people's daily life.The paper constructs the model of the assignment problem,and analyzes the existing ant colony algorithm applied in the problem.It designs a modified application of the ant colony algorithm in solving the assignment problem,which improves the accuracy and efficiency of the algorithm effectively.It also gives a brief analysis of the feasibility and advantages of using the ant colony algorithm in solving the assignment problem according to the results of experiments. |
| Keywords: | ant colony algorithm assignment problem combinatorial optimization Hungarian approach |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 | |
| 点击此处可从《计算机工程与科学》下载全文 | |
