Solution of a Difficult Workforce Scheduling Problem by a Genetic Algorithm

概要

論文の詳細を見る
This paper has two major goals: (1) to define a staff scheduling problem for a heterogeneous workforce with many realistic constraints extracted from the real world, and (2) to investigate its solution using a customized genetic algorithm featuring a group of operators which combine stochastic behavior and heuristics. After formulating the problem, schedules for the whole workforce are represented by integer chromosomes of fixed dimension. Violations of constraints and problem requirements are reflected by cost increases, and genetic operators act stochastically but tend to decrease such costs. Although the operators interact with each other, they were designed in an independent way for the sake of simplicity and modularity. Overall, the action of these stochastic-heuristic operators resembles a sophisticated mutation operator biased to improve schedules by reducing the costs of constraint violations. Experiments show that high-quality Workforce schedules can be obtained in reasonable time even for large problems.
一般社団法人情報処理学会の論文
1996-08-15