Show simple item record

contributor authorHong Zhang
contributor authorHeng Li
contributor authorC. M. Tam
date accessioned2017-05-08T21:13:14Z
date available2017-05-08T21:13:14Z
date copyrightMarch 2006
date issued2006
identifier other%28asce%290887-3801%282006%2920%3A2%28141%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/43257
description abstractIn 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.
publisherAmerican Society of Civil Engineers
titlePermutation-Based Particle Swarm Optimization for Resource-Constrained Project Scheduling
typeJournal Paper
journal volume20
journal issue2
journal titleJournal of Computing in Civil Engineering
identifier doi10.1061/(ASCE)0887-3801(2006)20:2(141)
treeJournal of Computing in Civil Engineering:;2006:;Volume ( 020 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record