Addendum to "a comparison of heuristics for a school bus scheduling problem"

Given a group of one or more schools, each with a specific arrival time window, and the bus routes serving these schools, the problem is to create an optimum set of combinations of routes to be served by a single bus, where optimality is defined in terms of fleet size and deadhead travel distance. We present the results of a computational study comparing ten heuristics, adapted from procedures which have appeared in the literature, on a set of 30 test problems derived from actual school data. This study is a follow on to that reported in Graham and Nuttle (1986).