DocumentCode :
3029856
Title :
Improved ACO Algorithm for Resource-Constrained Project Scheduling Problem
Author :
Zhou, Yumiao ; Guo, Qingshun ; Gan, Rongwei
Author_Institution :
Sun-Yatsen Univ., Guangzhou, China
Volume :
3
fYear :
2009
fDate :
7-8 Nov. 2009
Firstpage :
358
Lastpage :
365
Abstract :
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.
Keywords :
combinatorial mathematics; optimisation; scheduling; PC-2opt; ant colony algorithm; resource-constrained project scheduling problem; Ant colony optimization; Artificial intelligence; Benchmark testing; Computational intelligence; Dynamic programming; Gallium nitride; Heuristic algorithms; Large-scale systems; Processor scheduling; Scheduling algorithm; ACO; PC-2opt; RCPSP;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3835-8
Electronic_ISBN :
978-0-7695-3816-7
Type :
conf
DOI :
10.1109/AICI.2009.461
Filename :
5376698
Link To Document :
بازگشت