A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems


The particle swarm optimization (PSO) has been widely used to solve continuous problems. The discrete problems have just begun to be also solved by the discrete PSO. However, the combinatorial problems remain a prohibitive area to the PSO mainly in case of integer values. In this paper, we propose a combinatorial PSO (CPSO) algorithm that we take up… (More)
DOI: 10.1016/j.amc.2007.04.096


2 Figures and Tables


Citations per Year

197 Citations

Semantic Scholar estimates that this publication has 197 citations based on the available data.

See our FAQ for additional information.