Solving Assignment Problem Based on a Hybrid Ant Algorithm

摘要：

The difficulty to solve the assignment problem is that, when the number of jobs increases, the number of feasible solutions increases by geometric series. In order to solve that problem, this paper proposes a combinational algorithm of genetic algorithm (GA) and ant algorithm (AA). Theyre both probability algorithm. Genetic algorithm has the ability of global search quickly and stochastically, but it cant make good use of reactive information. Ant algorithm has the ability of parallel processing and global search, however, the cost of runtime of this algorithm is too much. The combination of them can conquer the defect of each other and shows their advantages to solve the assignment problem efficiently.

关键词： Assignment problem Ant algorithm Genetic algorithm Hybrid

作者: XU Chaoren LI Yongmei

作者单位: School of Software Xiamen University Xiamen, Fujian Province, China School of Computer Engineering Jimei University Xiamen, Fujian Province, China

会议类型: 国际会议

会议名称: 第一届国际计算机新科技与教育学术会议(Proceedings of the First International Conference on Computer Science & Education ICCSE2006)

会议地点: 厦门

会议语种:英文

页码: 84-86

在线出版日期: 2006-07-27（万方平台首次上网日期，不代表论文的发表时间）