论文部分内容阅读
针对多执行模式资源受限项目调度问题的具体特点,采用基于调度的编码方式、半随机的初始种群产生方式、受限变异等策略,提出一种克隆选择优化算法用于求解项目活动的最优调度以使整个工程工期最短.该方法将问题特性与免疫克隆选择算法所具有的全局搜索特性、解的多样性和不易早熟的特点相融合,在能获得最优解的前提下,使得所花费的代价大为降低.通过对标准测试库 PSPLIB 中调度问题的仿真实验表明,该算法具有良好的性能,对于各组测试集中的大部分问题都能在合理的时问内寻找到最优解.与其它启发式算法相比,该方法具有更优的性能.
Aiming at the specific characteristics of multi-execution resource constrained project scheduling problem, this paper proposes a clone selection optimization algorithm to solve the optimal project activity by using scheduling-based coding, semi-random initial population generation and limited mutation. Scheduling to minimize the entire project duration.This method combines the characteristics of the problem with the global search features, the diversity of solutions and the characteristics of precocious selection of the immune clone selection algorithm, which makes it costly to obtain the optimal solution Is greatly reduced.The simulation experiment of scheduling problem in PSPLIB shows that this algorithm has good performance and can find the optimal solution for most of the problems in each test set in a reasonable time. Compared with other heuristic algorithms, this method has better performance.