Bus scheduling: an interactive computer method

Abstract

A computer program has been developed which will take as input a list of bus trips to which vehicles are to be allocated, and will produce a schedule covering these trips. At intermediate stages of the solution process infeasible schedules are produced using fewer vehicles than would be necessary for a feasible schedule. Inspection of these schedules by management shows where revision of trip times would lead to a reduction in the number of vehicles required, and the computer will continue towards a feasible solution, incorporating any revisions made by management. The method is heuristic, the objectives being first to minimise vehicles, and second, to minimise empty mileage. The solution is optimal, or near optimal, and successful applications are described.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 21 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.