计算机工程与应用2011，Vol.47Issue(18)：135-138,152,5.DOI:10.3778/j.issn.1002-8331.2011.18.039
求解指派问题的一次性分配算法
One-time assignment algorithm to solve assignment problem
摘要
Abstract
Hungarian algorithm is an optimal global algorithm to solve assignment problem. However,there are some deficiencies in the classic Hungarian algorithm,such as the hardly achieving and slowly processing. This paper presents an improved algorithm on the base of the Hungarian algorithm,and improves the order of finding separate zero in Hungarian algorithm,as a result, it avoids the disadvantage of repeating assignment in Hungarian algorithm. By comparing the performance of the two algorithms for improved and classic Hungarian algorithm in eomplexity,running time and association accuracy, the results show that the improved Hungary arithmetic is a high-precision approximafive algorithm, can be easily achieved and lastly processed,and can be applyed to the application of real-time engineering.关键词
指派问题/匈牙利算法/一次性Key words
assignment problem/Hungarian algorithm/one-time分类
信息技术与安全科学引用本文复制引用
周莉,张维华,徐射雕..求解指派问题的一次性分配算法[J].计算机工程与应用,2011,47(18):135-138,152,5.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60672139,No.60672140) （the National Natural Science Foundation of China under Grant No.60672139,No.60672140）
山东省自然科学基 金(No.ZR2009GM001) （No.ZR2009GM001）
山东省高校科技计划项目(No.J09LG01) （No.J09LG01）
鲁东大学学科建设经费资助项目. （）
