Date of Award
6-1989
Document Type
Thesis
Degree Name
Master of Science (MS)
Legacy Department
Mathematical Science
First Advisor
James P. Jarvis
Abstract
The school bus routing problem as generally formulated is known to be NP-complete (no known polynomially bounded algorithm exists). However a variety of heuristic procedures can give near-optimal solutions. A survey and comparison of previous work in school bus routing is presented here.
Recommended Citation
DeVoe, Joanne E., "A Survey of School Bus Scheduling and Routing: Criteria, Methods, and Applications" (1989). Archived Theses. 227.
https://tigerprints.clemson.edu/arv_theses/227
COinS