基于混合算法求解指派问题  

Solving assignment problem based on mixed algorithm

作　　者：温晓磊[1] 王鹏涛[1] 

机构地区：[1]天津理工大学计算机与通信工程学院,天津300191

出　　处：《天津师范大学学报（自然科学版）》2009年第1期70-73,共4页Journal of Tianjin Normal University：Natural Science Edition

基　　金：天津市教委自然科学基金资助项目(20030618);天津市自然科学基金资助项目(043600511)

摘　　要：本研究建立了指派问题的数学模型,提出了以遗传算法和蚁群算法相结合的思想及其解决方案.算法主要是将每一个任务作为一个基因位形成染色体,以遗传算法控制寻优方向,更适宜解决组合优化问题.实验结果表明,使用此算法解决指派问题,提高了搜索效率,能够在短时间内找到最优分配方案,证明该算法是可行的.The mathematical model of assignment problem is established. By combining genetic algorithm with ant colony algorithm, the mixed algorithm for solving the problem is proposed. Every task is regarded as a genetic locus to form chromosome in this algorithm, and genetic algorithm used to search for optimal direction is suitable for solving combinatorial optimization problem. Experiment results show that the best solution can be found rapidly by using this algorithm, and the algorithm is proved feasible.

关 键 词：指派 组合优化 遗传算法 蚁群算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]