• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (4): 43-45.

• 论文 • 上一篇    下一篇

蚁群算法解决指派问题的研究和应用

殷人昆[1] 吴阳[2,3] 张晶炜[3,4]   

  • 出版日期:2008-04-01 发布日期:2010-05-19

  • Online:2008-04-01 Published:2010-05-19

摘要:

指派问题是在生产和生活中经常出现的问题。本文建立了指派问题的数学模型,对现有的解决指派问题的蚁群算法进行了分析,并设计了一种改进的解决指派问题的蚁群算法,有效地提高了蚁群算法解决指派问题的准确性和效率,并通过实验结果验证了应用蚁群算法解决指派问题的可行性和先进性。

关键词: 蚁群算法 指派问题 组合优化 匈牙利法

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 algor  ithm in solving the assignment problem, which improves the accuracy and efficiency of the algorithm effectively. It also gives a brief analysis of the f easibility and advantages of using the ant colony algorithm in solving the assignment problem according to the results of experiments.

Key words: ant colony algorithm, assignment problem, combinatorial optimization, Hungarian approach