Citation
Solving Resource-Constrained Project Scheduling Problem with Particle Swarm Optimization. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 251-258, 2007.
Paper
Abstract
This paper presents a Particle Swarm Optimization (PSO) algorithm for solving Resource-Constrained Project Scheduling Problems (RCPSP). The PSO model is a new population based optimization strategy introduced by Kennedy and Eberhart in 1995. The PSO is a cooperative and competitive algorithm who belongs to the class of the evolutionary algorithms. We here specialize the algorithm of PSO to the particular case of the RCPSP. We have redefined the PSO operators (the addition of two velocities, the difference between two positions, the external multiplication between a scalar and a velocity). We propose in this paper, an extension of the PSO system that integrates a new displacement of the particles and we highlight a relation between the coefficients for each dimension between the classical PSO algorithm and the extension. The experiments on instances from the PSPLIB show that the proposed PSO algorithm is able to solve to optimality most problems of the series and close to the best known solutions on the hardest instances. This seems to indicate that this general algorithm is a good candidate for solving scheduling problems.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-251-258-P, author = {S. Kemmoe Tchomt´e and M. Gourgand and A. Quilliot},
title = {Solving Resource-Constrained Project Scheduling Problem with Particle Swarm Optimization},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {251--258},
note = {Paper},
abstract = {This paper presents a Particle Swarm Optimization (PSO) algorithm for solving Resource-Constrained Project Scheduling Problems (RCPSP). The PSO model is a new population based optimization strategy introduced by Kennedy and Eberhart in 1995. The PSO is a cooperative and competitive algorithm who belongs to the class of the evolutionary algorithms. We here specialize the algorithm of PSO to the particular case of the RCPSP. We have redefined the PSO operators (the addition of two velocities, the difference between two positions, the external multiplication between a scalar and a velocity). We propose in this paper, an extension of the PSO system that integrates a new displacement of the particles and we highlight a relation between the coefficients for each dimension between the classical PSO algorithm and the extension. The experiments on instances from the PSPLIB show that the proposed PSO algorithm is able to solve to optimality most problems of the series and close to the best known solutions on the hardest instances. This seems to indicate that this general algorithm is a good candidate for solving scheduling problems.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-251-258-P.pdf} }