Permutation-based particle swarm optimization for resource-constrained project scheduling
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 141-149 |
Journal / Publication | Journal of Computing in Civil Engineering |
Volume | 20 |
Issue number | 2 |
Publication status | Published - Mar 2006 |
Link(s)
Abstract
In the light of particle swarm optimization (PSO) which utilizes both local and global experiences during search process, a permutation-based scheme for the resource-constrained project scheduling problem (RCPSP) is presented. In order to handle the permutation-feasibility and precedence-constraint problems when updating the particle-represented sequence or solution for the RCPSP, a hybrid particle-updating mechanism incorporated with a partially mapped crossover of a genetic algorithm and a definition of an activity-move-range is developed. The particle-represented sequence should be transformed to a schedule (including start times and resource assignments for all activities) through a serial method and accordingly evaluated against the objective of minimizing project duration. Experimental analyses are presented to investigate the performances of the permutation-based PSO. The study aims at providing an alternative for solving the RCPSP in the construction field by utilizing the advantages of PSO. © ASCE.
Research Area(s)
- Construction management, Optimization, Scheduling
Citation Format(s)
Permutation-based particle swarm optimization for resource-constrained project scheduling. / Zhang, Hong; Li, Heng; Tam, C. M.
In: Journal of Computing in Civil Engineering, Vol. 20, No. 2, 03.2006, p. 141-149.
In: Journal of Computing in Civil Engineering, Vol. 20, No. 2, 03.2006, p. 141-149.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review