一种求解资源受限项目调度问题的差分进化-布谷鸟搜索算法

摘要

提出一种新颖的求解资源受限项目调度问题的差分进化-布谷鸟搜索（DE-CS）算法。DE-CS算法以全局搜索能力强的布谷鸟搜索算法为总框架，通过嵌入具有记忆搜索功能的差分进化算法，结合不同的个体更新操作，增加种群的多样性以改善算法收敛性。采用任务优先级编码和串行进度生成机制来求解PSPLIB问题库中J30、J60、J120的全部480、480和600个问题，以验证算法的有效性，并与多种算法调度结果进行对比。数值试验和算法比较验证了DE-CS算法求解RCPSP问题的有效性。%A hybrid of differential evolution and cuckoo search algorithm,namely DE-CS algorithm,is pro-posed to solve the resource-constrained project scheduling problem.The new algorithm takes CS with strong global search ability as its framework,and embedded DE with memory search ability.Besides,the proposed algorithm combines different individual update operations in solving specific objective to improve the algorithm convergence.In order to evaluate the performance of the algorithm,the coding scheme based on task priority coding and serial schedule generation scheme is used for PSPLIB problems in which all the 480,480 and 600 instances are evaluated from J30,J60 and J120 set,respectively.Experimental results and comparison show the effectiveness of the proposed DE-CS algorithm.