A Solution to Resource-Constrained Project Scheduling Problem Based on Ant Colony Optimization Algorithm

摘要：

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.

关键词： Ant Colony Optimization Constraint Resource Project Scheduling

作者: Yongbo Yuan Kai Wang Le Ding

作者单位: School of Civil and Hydraulic Engineering Dalian University of Technology Dalian, China

会议类型: 国际会议

会议名称: 2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)

会议地点: 沈阳

会议语种:英文

页码: 1-5

在线出版日期: 2009-08-12（万方平台首次上网日期，不代表论文的发表时间）