摘要
指派问题是在生产和生活中经常出现的问题。本文建立了指派问题的数学模型,对现有的解决指派问题的蚁群算法进行了分析,并设计了一种改进的解决指派问题的蚁群算法,有效地提高了蚁群算法解决指派问题的准确性和效率,并通过实验结果验证了应用蚁群算法解决指派问题的可行性和先进性。
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.
出处
《计算机工程与科学》
CSCD
2008年第4期43-45,112,共4页
Computer Engineering & Science
基金
国家自然科学基金资助项目(60672139,60672140)
关键词
蚁群算法
指派问题
组合优化
匈牙利法
ant colony algorithm
assignment problem, combinatorial optimization
Hungarian approach
