PSO for solving RCPSP

Author

Peng, WuLiang ; Wei, Yonghe

Author_Institution

Sch. of Econ. & Manage., Shenyang Ligong Univ., Shenyang

fYear

2008

fDate

2-4 July 2008

Firstpage

818

Lastpage

822

Abstract

To enrich the calculation means of resource-constrained project scheduling problem(RCPSP), a particle swarm optimization (PSO) algorithm is presented. A new permutation of priority-based encoding scheme is designed in the algorithm, and it inherits all the merits of both the permutation-based encoding scheme and the priority-based encoding scheme. The velocity-updating mechanism is formulized based on the vector similarity theory according to the characteristics of RCPSP, and in the position-updating mechanism the particles can move according to the so called vector velocity and dimension velocity. A full factorial computational experiment was set up using the well-known standard instances in PSPLIB, and the results reveal that the algorithm is effective for the RCPSP.

Keywords

particle swarm optimisation; project management; scheduling; PSO; PSPLIB; particle swarm optimization algorithm; permutation-based encoding scheme; position-updating mechanism; priority-based encoding scheme; resource-constrained project scheduling problem; vector similarity theory; velocity-updating mechanism; Algorithm design and analysis; Birds; Computational intelligence; Computational modeling; Encoding; Mechanical engineering; Optimization methods; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Particle Swarm Optimization; Project Management; Resource-constrained Project Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference, 2008. CCDC 2008. Chinese

Conference_Location

Yantai, Shandong

Print_ISBN

978-1-4244-1733-9

Electronic_ISBN

978-1-4244-1734-6

Type

conf

DOI

10.1109/CCDC.2008.4597427

Filename

4597427