Masters Theses
Abstract
"This thesis presents an algorithm which selects from a given set of stops a subset of stops corresponding to a given bus which minimize the riding time of students in going to and from school. The time required in picking up students at their stops and delivering them to school is analyzed. An example is given which illustrates the formulation of a problem and the results obtained from the solution. Finally, the program which was used in the solution of the problem is given along with its implementation"-- Abstract, p. ii
Advisor(s)
Byers, James K.
Committee Member(s)
Gillett, Billy E.
Rozell, Ronald J., 1928-1981
Department(s)
Computer Science
Degree Name
M.S. in Computer Science
Publisher
University of Missouri--Rolla
Publication Date
1974
Pagination
v 48 pages
Note about bibliography
Includes bibliographical references (page 27)
Rights
© 1974 Dennis Ray Morgan, All rights reserved.
Document Type
Thesis - Open Access
File Type
text
Language
English
Thesis Number
T 3078
Print OCLC #
6018715
Recommended Citation
Morgan, Dennis Ray, "An algorithm for minimizing the riding time of students on school buses." (1974). Masters Theses. 3401.
https://scholarsmine.mst.edu/masters_theses/3401