A Hybrid Particle Swarm Algorithm for Resource-Constrained Project Scheduling

Author(s):  
Jens Czogalla ◽  
Andreas Fink

The authors present and analyze a particle swarm optimization (PSO) approach for the resource-constrained project scheduling problem (RCPSP). It incorporates well-known procedures such as the serial schedule generation scheme and it is hybridized with forward-backward improvement. The authors investigate the application of PSO in comparison to state-of-the-art methods from the literature. They conduct extensive computational experiments using a benchmark set of problem instances. The reported results demonstrate that the proposed hybrid particle swarm optimization approach is competitive. They significantly improve previous results of PSO for the RCPSP and provide new overall best average results for the medium size data set. Furthermore, the authors provide insights into the importance of crucial components for achieving high-quality results.

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Shuai Li ◽  
Zhicong Zhang ◽  
Xiaohui Yan ◽  
Liangwei Zhang

In this paper, a new probability mechanism based particle swarm optimization (PMPSO) algorithm is proposed to solve combinatorial optimization problems. Based on the idea of traditional PSO, the algorithm generates new particles based on the optimal particles in the population and the historical optimal particles in the individual changes. In our algorithm, new particles are generated by a specially designed probability selection mechanism. We adjust the probability of each child element in the new particle generation based on the difference between the best particles and the elements of each particle. To this end, we redefine the speed, position, and arithmetic symbols in the PMPSO algorithm. To test the performance of PMPSO, we used PMPSO to solve resource-constrained project scheduling problems. Experimental results validated the efficacy of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document