一种改进的自适应遗传算法求解专家分配问题  

Improved adaptive genetic algorithm for expert assignment problem

作　　者：李娜娜[1] 顾军华[2] 宋洁[2] 刘伯颖[3] 任超[2] 

机构地区：[1]天津大学计算机科学与技术学院,天津300072 [2]河北工业大学计算机科学与软件学院,天津300130 [3]河北工业大学教务处,天津300130

出　　处：《计算机应用》2007年第9期2276-2278,2293,共4页journal of Computer Applications

摘　　要：基金项目管理中,专家分配问题的研究具有很现实的意义。在解决专家分配问题上做过一些基础性的工作,提出了使用遗传算法及一种信息素指导变异的新算法求解该问题。实验证明,遗传算法是一种可行的途径,并且信息素指导下的启发式变异操作,可以加速算法向最优解搜索。但是,这两种方法都存在局部搜索能力差的问题,在算法运行的中后期会出现大量的冗余迭代。鉴于此,提出一种信息素指导下的自适应变异方法求解专家分配问题。实验证明,新算法具有更强的收敛能力和局部搜索能力。Expert assignment is chief and basic work of project review in project management. So it is significant to research how to solve expert assignment problem （EAP）. In previous papers, we established the mathematical model of expert assignment problem, and proposed genetic algorithm and GA using heuristic mutation guide by pheromone to solve EAP. Though it has been proven they are effective ways for EAP, they have disadvantages of massive redundancy iteration in later period and inferior local search ability. In this paper a modification of GA which introduces adaptive mutation is proposed to solve EAP. The simulation results show that the new algorithm improves the ability of local search and generates solutions of better quality.

关 键 词：专家分配 遗传算法 蚂蚁算法 自适应变异 信息素 

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