To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extend...To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved. The HACO is tested on the set of large benchmark problems from the project scheduling problem library （PSPLIB）. The computational result shows that the proposed algo- rithm can improve the quality of the schedules efficiently.展开更多
迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防...迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防止陷入局部最优。迭代过程中通过优先对关键链的任务进行局部搜索进一步缩小解空间,通过双对齐技术提高解的质量。最终通过标准问题库求出各项参数并且验证算法的性能。展开更多
基金supported by Liaoning BaiQianWan Talents Program(20071866-25)
文摘To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved. The HACO is tested on the set of large benchmark problems from the project scheduling problem library （PSPLIB）. The computational result shows that the proposed algo- rithm can improve the quality of the schedules efficiently.
文摘迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防止陷入局部最优。迭代过程中通过优先对关键链的任务进行局部搜索进一步缩小解空间,通过双对齐技术提高解的质量。最终通过标准问题库求出各项参数并且验证算法的性能。
