信息与电子工程2011，Vol.9Issue(4)：510-514,5.
改进蚁群算法求解多属性双边稳定匹配问题
An improved ant colony algorithm for multi-attribute stable bipartite matching problems
摘要
Abstract
The multi-attribute bilateral matching problems are discussed from the stable matching point of view. The concepts and definitions of multi-attribute bilateral stable matching are introduced, as well as the definitions and the sorting rules of the matching extent. Then evaluation functions and rules are proposed for the stable matching results. Based on an improved state transition strategy and an improved pheromone update strategy, an improved Ant Colony Algorithm(ACO) is presented for these problems. The simulation results show that the improved ACO can solve the traditional stable matching problems, and is also effective in solving the multi-attribute bilateral stable matching problems.关键词
蚁群算法/多属性/双边匹配/稳定匹配Key words
Ant Colony Algorithm/ multi-attribute/ bipartite matching/ stable matching分类
信息技术与安全科学引用本文复制引用
刘永强,常青,熊华钢..改进蚁群算法求解多属性双边稳定匹配问题[J].信息与电子工程,2011,9(4):510-514,5.基金项目
国家自然科学基金资助项目(60872062,60879024) （60872062,60879024）
国家科技支撑计划项目城市安全生产风险动态监管技术研究与示范项目(2011BAK01B00) （2011BAK01B00）
