On finding the cheapest and fastest route
Date of Publication
2008
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with specialization in Business Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Kristine Joy E. Carpio
Defense Panel Chair
Ederlina G. Nocon
Defense Panel Member
Edmundo R. Perez
Mark Oyelle L. Moderno
Abstract/Summary
The thesis is about taking the optimal route from several origins in Makati City to De La Salle University-Manila. We took into account the primary costs such as gasoline or fare cost and travel time cost the minimum cost among the common routes used by student motorists and drivers were taken. We considered both the case of public transport users and private car users. In coming up with a solution, we used Dijkstra's Algorithm to take the optimal route from every single origin and Linear programming to evaluate the best place in Makati based on the integrated time and navigation cost.
Abstract Format
html
Language
English
Format
Accession Number
TU15416
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vii, 67 leaves, illustrations, 28 cm.
Keywords
Route choice--Statistical methods; Traffic surveys--Philippines; Traffic flow--Philippines
Recommended Citation
Ebanos, N. F., & Florendo, S. S. (2008). On finding the cheapest and fastest route. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/5068
Embargo Period
3-29-2021
