基于遗传算法的资源约束型项目调度优化

发布时间：2018-08-20 12:22

【摘要】：资源约束型项目调度的优化是一个NP-hard问题,其求解难度随着资源约束项的增多呈指数方式增长,传统的基于Excel表的手工优化方法不能及时计算出有效的资源配置方式,从而影响项目管理人员的资源调度。针对多资源约束型项目调度的优化问题提出基于遗传算法的资源约束型项目调度的优化方法,该算法采用基于活动优先权的十进制编码方式,结合活动的存储邻接矩阵,有效地解决活动调度违例现象;运用优先抢占模式的资源分配方式安排活动资源,避免资源分配中的冲突问题;并为该算法设计了启发式遗传算法的C语言程序,通过计算机的多次迭代运算得出满足资源约束的最优工期。实践结果表明,遗传算法可以快速有效地解决企业项目调度的优化问题,适合在企业项目进度管理中推广运用。
[Abstract]:The optimization of resource constrained project scheduling is a NP-hard problem. The difficulty of solving the problem increases exponentially with the increase of resource constraint items. The traditional manual optimization method based on Excel table can not calculate the effective resource allocation method in time. Thus affecting the resource scheduling of project managers. For the optimization of multi-resource constrained project scheduling, a genetic algorithm based optimization method for resource-constrained project scheduling is proposed. The algorithm adopts a decimal coding method based on activity priority and combines the memory adjacency matrix of activities. To solve the problem of activity scheduling violation effectively, to arrange the active resources by the way of resource allocation in priority preemption mode, to avoid the conflict problem in resource allocation, and to design the C language program of heuristic genetic algorithm for this algorithm. The optimal time limit satisfying the resource constraints is obtained by multiple iterations of the computer. The practical results show that the genetic algorithm can solve the optimization problem of enterprise project scheduling quickly and effectively, and it is suitable to be popularized and applied in enterprise project schedule management.
【作者单位】：上海交通大学机械与动力工程学院;
【分类号】：F224.3

【参考文献】