Back to search
Clemson University
A Survey of School Bus Scheduling and Routing: Criteria, Methods, and Applications
Abstract
dc:description.abstractThe 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- DeVoe, Joanne E.
- Contributors dc:contributor
-
- James P. Jarvis
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/arv_theses/227