ANT COLONY OPTIMIZATION ALGORITHM FOR EXPERT ASSIGNMENT PROBLEM
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 algorithms (GAs) to solve EAP. Though it has been proven GAs are effective ways for EAP, they have disadvantages of slow convergence speed. In this paper, ant colony optimization (ACO), which has more powerful ability to solve complicated discrete optimization problem, is introduced to solve EAP. The simulation results show that ACO improves the convergence and generates solutions of better quality.
Ezpert Assignment Problem Ant Colony Optimization Pheromone Heuristic information
NA-NA LI ZHENG ZHAO JUN-HUA GU BO-YING LIU
School of Computer Science and Technology, Tianjin University, Tianjin 300072, China Hebei Universit School of Computer Science and Technology, Tianjin University, Tianjin 300072, China Hebei University of Technology, Tianjin 300130, China
国际会议
2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)
昆明
英文
660-664
2008-07-12（万方平台首次上网日期，不代表论文的发表时间）