• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (09): 1722-1727.

• 论文 • Previous Articles     Next Articles

Critical chain project management
based on the improved ant colony algorithm    

LUO Yuebin,ZHAO Yingjun,WANG Hua   

  1. (The Missile Defense Institute,Air Force Engineering University,Xi’an 710053,China)
  • Received:2014-01-16 Revised:2014-03-18 Online:2014-09-25 Published:2014-09-25

Abstract:

The progress is important in project management.As one of the commonly used schedule management methods in current project management,the critical chain method is a multiconstrained optimization problem in its nature.Chaos Ant AlgorithmGenetic Algorithm (CAAGA) is used to solve the optimal scheduling problem based on Critical Chain Project Management (CCPM). By making use of the characteristics of ergodicity and randomness of chaotic motion, the traditional Ant Colony Algorithm (ACA) is improved.It can get rid of the ACA’s faults that more time is required to seek the solution because of lacking pheromone at the beginning and it is easily trapped into the local solution.It extends the search area,improves the evolution speed of ant colony,and maintains the robust and convergence the ant colony algorithm.It has higher computing accuracy and speed.An example shows that the CAAGA method is better than the AGA method in solving this issue.

Key words: critical chain;chaos;ant colony algorithm;genetic algorithm;project management