一类人员调配问题的导引式局部搜索算法

描述一类生活实践中常见的可能存在过度约束的人员调配问题．这类问题用传统的分支定界等精确搜索算法求解时比较困难。本文则探讨了一种较新的超启发式搜索方法导引式局部搜索在求解这类过度约束人员调配问题中的应用。与其他常用的超启发式搜索算法如禁忌搜索和模拟退火的比较表明，GLS在此类问题的求解质量、求解速度和算法鲁棒性方面具有较好的综合性能。

The Guided Local Search Method for a Class of Workforce Scheduling Problems

A class of frequently met workforce scheduling problems that may be over-constrained in the real world is (described.) Such problems are difficult to be resolved using the classical brunch-and-bound system search method. We (then) (discuss) the application of Guided Local Search, a new kind of meta-heuristics, in such problems. As compared with (other) (common) used meta-heuristics such as Tabu Search and Simulated Annealing, Guided Local Search shows notable (better) (performance) as to solution quality, solving rapidity and algorithm robustness.