Finding the shortest pick-up route problem of a bus service
Date of Publication
1991
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Applied Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The study involves the problem of finding the optimal route of a school bus service. The travelling salesman problem in graph theory was considered in the solution of the problem and hamiltonian cycles starting from the school to each of the student's house and back were sought. A computer program was developed to determine this path based on a working algorithm. Factors such as time and mileage were also considered to come up with the recommended economical routes.
Abstract Format
html
Language
English
Format
Accession Number
TU05690
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
76 leaves
Keywords
Route surveying; Bus lines; Graph theory; Problem solving
Recommended Citation
Acasio, A. P., & See, D. C. (1991). Finding the shortest pick-up route problem of a bus service. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15942
