求解资源受限项目调度的双种群准粒子群算法计算机集成制造系统.pdfVIP

求解资源受限项目调度的双种群准粒子群算法1 何杰光，陈新度，陈 新，刘 强 (广东工业大学 广东省计算机集成制造重点实验室，广东 广州 510006) 摘要：针对资源受限项目调度问题，提出了一种新的双种群准粒子群算法。新算法基于粒子群 的寻优原理，重新定义了粒子的位置更新公式，加入了多样性信息部分，并对公式中的位置差、标 量与位置差的乘积以及位置和运算进行了重新定义。通过结合项目调度的问题特征，使用活动列表 对粒子进行编码，设计一种新的双向路径重连实现位置的减法操作，使用选择实现位置差和标量的 乘法操作，而使用均匀块交叉实现位置和操作，并提出正向粒子群和反向粒子群双种群并行进化的 方式。通过实验设计的Taguchi方法求得了新算法的最优参数组合。对标准测试库PSPLIB 的J30,J60 和J120 问题集和一个实际的装配项目案例进行了仿真测试，结果表明，双种群准粒子群算法优于当 前主要的基于粒子群的算法，此外，通过与其他启发式算法进行比较，也验证了算法的有效性。 关键词：资源受限项目调度；粒子群优化；双向路径重连；均匀块交叉；双种群进化 中图分类号：TP391 文献标识码：A Using double-population quasi particle swarm optimization to solve resource-constrained scheduling problem HE Jie-guang，CHEN Xin-du，CHEN Xin，LIU Qiang (Guangdong Provincial Key Laboratory of Computer Integrated Manufacturing System, GuangdongUniversity of Technology, Guangzhou 510006, China) Abstract: To solve the Resource-Constrained Project Scheduling Problem (RCPSP), a new double-population quasi particle swarm optimization (DPQ-PSO) was proposed. Based on the optimization principle of the basic PSO, DPQ-PSO redefined the position update formula by abandoning the velocity part and introducing a new component of diversity information. The subtraction between positions, the multiplication of a subtraction by a scalar and the addition between positions were also redefined. For the problem-specific characteristics of the PCPSP, a particle was represented by an activity list. Besides, a new bidirectional path relinking was used to implement the subtraction; a selection operation was used to implement the scalar multiplication; and a new uniform block crossover was used to fulfill the addition. Moreover, for the population diversity, a double-population parallel evolutionary mechanism was also