A Dual Heuristic for Vehicle Scheduling

A heuristic method is used to solve the vehicle scheduling problem by maintaining local optimality whilst approaching the feasible region. Tests with published problems show that the technique gives results comparable with the best published algorithms. The practical requirements of real life scheduling are discussed, and the flexibility of the technique is demonstrated for a complex problem involving weekly cyclical deliveries.