点击次数：

论文类型：会议论文

发表时间：2009-08-12

收录刊物：EI、CPCI-S、Scopus

卷号：1

页面范围：446-450

关键字：Ant Colony Optimization; Constraint Resource; Project Scheduling

摘要：Ant Colony Optimization (ACO) is a popular-based, artificial agent, general-search technique for the solution of difficult combinatorial problems. This paper presents a solution to the Resource-Constraint Project Scheduling Problem based on ACO algorithm. The method considers the quantified duration and resource as the heuristic information to calculate the accurate state transition probability and finally reaches the scheduling optimization. The described ACO algorithm is tested on a sample case taken from the literature and the parameters in ACO are determined by tests. The computational results validate the effectiveness of the proposed algorithm.