多执行模式资源受限工程调度问题的优化算法

Optimization algorithm for solving multi-mode resource- constrained project scheduling problem

近几年来 ,模拟退火 (SA)和遗传算法 (GA)等智能优化方法在求解组合最优化问题方面显示出了较强的能力 ,许多文献报告了它们在这类问题上的应用 ,有些文献则报告了一些它们的混合算法 .然而 ,这些算法对问题的求解效果因问题的结构不同而有很大差异 ,它们的成功设计必需充分结合问题本身的特点 .本文针对多执行模式资源受限工程调度问题的特点 ,设计了一种 SA/ GA混合算法 ,利用被普遍应用的标准问题对该算法进行了测试 。

In recent years, the intelligent optimization algorithms such as simulated annealing (SA) and genetic algorithms (GA) have been showing powerful abilities for solving combinatorial optimization problems, many papers reported their applications in such type problems, and some papers reported some hybrid algorithms. However, the effectiveness of the algorithm is very different between different problem characteristics. Their successful design must combine with the problem characteristics. In this paper, we design a SA/GA hybrid algorithm for solving multi mode resource constrained project scheduling problem based on the problem characteristics. Thorough computational study for a standard set of project instances which has been widely used, we obtained some satisfactory results.