求解多模式资源约束项目调度问题的离散粒子群算法

Discrete particle swarm optimization for solving multi-mode resource-constrained project scheduling problem

多模式资源约束项目调度问题(MRCPSP)是在传统的资源约束项目调度问题基础上增加多种执行模式和不可更新资源约束条件后,再寻求总完工时间的最小化。为此提出了一种改进的离散粒子群算法(DPSO)用于求解此类问题。为了验证算法的有效性,选取了不同规模的上千算例进行了测试,并与相关文献给出的结果进行了比较,各算例平均偏差均小于其他算法的计算结果,且获得最优解的百分比明显高于文献中其他算法的结果。表明该算法无论在计算精度还是计算效率方面都具有较强的可比性。

In this paper,a Discrete Particle Swarm Optimization（ DPSO） algorithm was proposed to solve the Multi-mode Resource Constrained Project Scheduling Problem（ MRCPSP）. In order to verify the algorithm to be effective,different scales of thousands of examples were tested. The results were compared with other algorithms in the relevant literatures. It is shown that the average deviation is less than the calculation results of the other algorithms. the percentage of the optimal solution is significantly higher than those of other algorithms,so the proposed algorithm has a better comparability in computation accuracy and computational efficiency.