Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8355
Title: Permutation-based particle swarm optimization for resource-constrained project scheduling
Authors: Zhang, H
Li, H 
Tam, CM
Keywords: Construction management
Optimization
Scheduling
Issue Date: 2006
Publisher: American Society of Civil Engineers
Source: Journal of computing in civil engineering, 2006, v. 20, no. 2, p. 141-149 How to cite?
Journal: Journal of computing in civil engineering 
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.
URI: http://hdl.handle.net/10397/8355
ISSN: 0887-3801
EISSN: 1943-5487
DOI: 10.1061/(ASCE)0887-3801(2006)20:2(141)
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

30
Last Week
1
Last month
0
Citations as of Oct 11, 2017

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
1
Citations as of Oct 17, 2017

Page view(s)

53
Last Week
2
Last month
Checked on Oct 23, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.