Improved ACO Algorithm for Resource-Constrained Project Scheduling Problem
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference（2009）
摘要
The resource-constrained project scheduling problem (RCPSP) is a typical combinatorial optimization problem. Base on the general model of ant colony algorithm for solving the RCPSP, this paper presents a new 2opt called PC-2opt which guarantees precedence constraints between activities. PC-2opt, which needn't to calculate the location of successors, could be directly used to solve the RCPSP, and improve the time efficiency. Proved by experiments, the local search mechanism presented is feasible, effective and better than other similar algorithms to some extent.
更多查看译文
关键词
optimisation,scheduling,typical combinatorial optimization problem,rcpsp,improved aco algorithm,general model,combinatorial mathematics,ant colony algorithm,pc-2opt,similar algorithm,aco,resource-constrained project scheduling problem,precedence constraint,local search mechanism,time efficiency,algorithm design and analysis,local search,probability density function,radio frequency,schedules,data mining
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要