A vehicle routing problem in banking
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
Arlene A. Pascasio
Mark Oyelle L. Morderno
Abstract/Summary
This thesis presents an optimal armored vehicle route that visits some of the clients of Metrobank in Cebu City, Philippines. This route must satisfy demands without violating the total allowable time and the vehicle capacity constraints. We focus on four possible cost drivers: operating cost, driving time, average unloading time and the average demand of all customers. Finally, results of a computational study using the Intelligent Solution System [5] would show the optimal number of vehicles to be employed, the number of customers that will be served in each area and the minimum cost in order to perform all the deliveries.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
TU15413
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vii, 198 leaves, illustrations, (some color), 28 cm.
Keywords
Vehicle routing problem; Transportation problems (Programming); Traveling salesman problem
Recommended Citation
Bangayan, J. Y., & Guanzon, M. G. (2008). A vehicle routing problem in banking. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/5079
Embargo Period
3-25-2021