粒子群优化在资源受限工程调度问题中的应用

Particle swarm optimization for resource-constrained project scheduling problem

用多维粒子来描述以项目工期最小为目标的资源受限问题.通过粒子在不断更新的轨道里寻优来解决资源受限的工程调度问题.依照基于优先权和基于排列两种方法建立了该算法的运算框架,并通过具体的算例对其有效性进行了检验.结果表明,将粒子群优化算法应用于资源受限工程调度问题切实可行,而且该算法较其他同类方法(如GA等)具有更好的优化效果,为解决该类问题提供了一种新的方法.

The potential solution to the resource -constrained project scheduling problem （RCPSP） that aiming at minimizing project duration can be represented by the multidimensional particle. Particle swarm optimization （PSO） which performs through particle flying along the trajectory that is continuously updated can be used in solving the RCPSP. The framework of the PSO for the RCPSP is developed according to priority - based representation and permutation - based representation, and the performance of the method is presented by the practical analyses. The results show that PSO is effective in solving RCPSP and the method performs better than other arithmetic such as GA, and it provides a new way for dealing with this kind of problems.