A genetic algorithm for public transport driver scheduling

Abstract

The problem of constructing daily shifts for public transport (generally bus) drivers is explained, and some of the currently available computer based solution methods are introduced. The need for improved methods is set out, and one of the more widely applied current methods is outlined in sufficient detail to show where new approaches may profitably be introduced. A feasibility study is described in which a simple genetic algorithm has been developed in order to examine the suitability of such an approach. This has required the development of a new crossover operator. Such an algorithm could ultimately replace part of the presented existing method, making it more efficient in terms of both of quality of result and of time taken to produce a good schedule. The simple algorithm has been shown to produce comparable results to the existing method on a test problem. The results encourage further investigation, but some complexities which can exist in real problems require further study. The results of the present experiments are presented, and the further complexities are discussed in the context of the genetic approach.