计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (24): 17-20.DOI: 10.3778/j.issn.1002-8331.2009.24.006

• 博士论坛 • 上一篇    下一篇

应用遗传模拟退火算法实现资源受限项目调度

喻小光1,2,战德臣1,聂兰顺1   

  1. 1.哈尔滨工业大学 计算机科学与技术学院,哈尔滨 150001
    2.华侨大学 计算机科学与技术学院,福建 泉州 362021
  • 收稿日期:2009-05-26 修回日期:2009-06-29 出版日期:2009-08-21 发布日期:2009-08-21
  • 通讯作者: 喻小光

Genetic simulated annealing algorithm for resource-constrained project scheduling problem

YU Xiao-guang1,2,ZHAN De-chen1,NIE Lan-shun1   

  1. 1.School of Computer Science and Technology,Harbin Institute of Technology,Harbin 150001,China
    2.School of Computer Science and Technology,Huaqiao University,Quanzhou,Fujian 362021,China
  • Received:2009-05-26 Revised:2009-06-29 Online:2009-08-21 Published:2009-08-21
  • Contact: YU Xiao-guang

摘要: 针对以最小化项目工期为目标的资源受限项目调度问题(RCPSP),提出将模拟退火算法融合到遗传算法中,以改善遗传算法局部搜索性能,增强进化能力的遗传模拟退火算法——RCPSPGSA。在每次进化迭代过程中,下一代种群的个体需经过模拟退火算法改进,并通过在每次迭代结束前进行降温操作保证遗传算法和模拟退火算法具有相同的收敛方向和速度。算法在RCPSP标准测试问题库PSPLIB上进行数值仿真实验,并采用正交实验分析法解决参数选择问题。实验结果证明选择的参数组合具有突出的性能,RCPSPGSA是求解RCPSP的有效算法。

Abstract: A novel hybrid meta-heuristic algorithm,entitled as RCPSPGSA,is proposed for solving the Resource-Constrained Project Scheduling Problem(RCPSP).The algorithm incorporates the Simulated Annealing algorithm(SA) into genetic algorithm in order to improve local searching performance and boost up evolution capability.In each evolution iteration GA generates a new temporary population,and after that SA is used for improving every individual in it and at the mean time the next gap population is generated.For the sake of keeping the same convergence direction and speed of GA and SA,the cooling procedure occurs at the end of each evolution iteration.Simulation experiments are performed on the standard project instance sets of PSPLIB,and orthogonal experiment method is introduced to solve the parameter selection problem.Parameter combinations selected by this method are proved to be outperformed.Experimental results show that RCPSPGSA improves solution quality for J30,J60,J90 sets and not bad for J120.

中图分类号: