黄少荣. 资源约束多模式项目调度的遗传算法研究[J]. 微电子学与计算机, 2011, 28(9): 165-168.
引用本文: 黄少荣. 资源约束多模式项目调度的遗传算法研究[J]. 微电子学与计算机, 2011, 28(9): 165-168.
HUANG Shao-rong. Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm[J]. Microelectronics & Computer, 2011, 28(9): 165-168.
Citation: HUANG Shao-rong. Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm[J]. Microelectronics & Computer, 2011, 28(9): 165-168.

资源约束多模式项目调度的遗传算法研究

Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm

  • 摘要: 针对以工期最短为优化目标的多模式资源约束优化调度问题进行研究, 在建立数学模型基础上, 采用改进遗传算法对模型进行求解.算法设计上, 对各活动的执行模式进行统一编号, 使模式的内部编号包含了时序约束、资源约束、工期等信息, 针对活动执行模式采用特殊的整数编码方式, 染色体基因由活动执行模式序号组成.对染色体结构设计了单点交叉和单点变异操作算子, 采用锦标赛选择方法.通过实例验证了改进遗传算法在求解MMRCPSP上的有效性.

     

    Abstract: To improve the Multi-Mode Resource-Constrained Project Scheduling Problem (MMRCPSP), based on constructed the mathematical model of MMRCPSP, a new genetic algorithm is proposed.The objective is to determine a mode and a start time for each activity such that all constraints are observed and the project duration is minimized.A special integer coding scheme is used in the algorithm, each gene represents the execution mode and the start time of an activity.By designing appropriate genetic operators, the proposed genetic algorithm is effective to solve this problem.The experimental result indicated the effectiveness of the algorithm.

     

/

返回文章
返回