Model and solutions for vehicular routing problem of metal closure and lithography plant San Miguel Corporation
Date
6-1992
Degree
Bachelor of Science in Applied Mathematics
College
College of Arts and Sciences (CAS)
Adviser/Committee Chair
Norberto R. Navarrete Jr.
Abstract
This special problem presented a model and three different methods of solving the vehicular routing problem of Metal Closure and Lithography Plant, San Miguel Corporation. The three methods are Zero- One Programming, Sweep Algorithm and Clarke and Wright Savings Algorithm. After the of MCLP was formulated, It was concluded that Zero-One Programming, though gives an exact solution, can't be used because the model contains 3,955 variables and solving this model would require much time. Clarke and Wright Savings Algorithm was used to solve the VRP of MCLP instead of the Sweep Algorithm because studies show that Savings Algorithm is more efficient in terms of the final tour generated to Sweep Algorithm. The solution of VRP for MCLP was also presented.
Language
English
Location
UPLB Main Library Special Collections Section (USCS)
Call Number
Thesis
Recommended Citation
Yap, Maricar G., "Model and solutions for vehicular routing problem of metal closure and lithography plant San Miguel Corporation" (1992). Undergraduate Theses. 10244.
https://www.ukdr.uplb.edu.ph/etd-undergrad/10244
Document Type
Thesis