Research on the Ant Colony Optimization Algorithm for Resource-Constrained Project Scheduling Problem
This paper presents a methodology to reach the scheduling optimization of the project under constraint resource with Ant Colony Optimization (ACO) algorithm. ACO is a popular-based, artificial agent, general-search technique for the solution of difficult combinatorial problems. The method considers the quantified duration and resource as the heuristic information in order to calculate the accurate state transition probability and finally arrives at a reasonable project scheduling. The described ACO approach is supplemented by a sample case study as well as algorithms for the solution of resource-constrained project schedules.
Ant Colony Optimization Constraint Resource Project Scheduling
Kai Wang Yongbo Yuan Le Ding
School of Civil and Hydraulic Engineering, Dalian University of Technology, Dalian, 116085,P.R. China
国际会议
The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)
长沙
英文
87-92
2009-06-01(万方平台首次上网日期,不代表论文的发表时间)