摘要
根据蚁群算法的性质与资源约束项目排序问题(CPSP:Resource-Constrained Project Schedul- ing Problem)的特征,本文给出了蚁群算法中信息素的表示及更新方案、启发信息的计算方法等,由此提出了一种求解RCPSP的修正蚁群算法。最后,通过对项目排序问题库中的标准问题集进行计算,结果表明本文提出的修正蚁群算法是可行优良的。
By using characteristics of ant colony optimization and heuristic rules of the resourceconstrained project scheduling problem （RCPSP）, a modified ant colony algorithm is proposed for solving RCPSP, We give some methods to represent and update the pheromone, and the method to compute the heuristic information. Finally, we test the algorithms with problems from the standard problem library PSPLIB, computational results show that our algorithm is feasible and efficient.
出处
《工程数学学报》
CSCD
北大核心
2007年第3期437-445,共9页
Chinese Journal of Engineering Mathematics
基金
国家自然科学基金(70371032).
关键词
资源约束
项目排序
蚁群算法
resource-constraint
project scheduling
ant colony algorithm
