Skip to Main Content
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.