Abstract
The Vehicle Routing Problem is an integer programming problem and combinatorial optimization that designs the optimal set of the route for a fleet of vehicles to travel in order to deliver to a given set of customers. This research study aimed to calculate and determine the best route for delivering the products in the different cities of Pangasinan using the Clarke-Wright Method and Branch & Bound Method with a starting point in Dagupan. The main objective of this study is to determine which of the two methods is more easy and effective to use for finding the optimal route for the vehicle routing problem that minimizes the cost of travel of deliveries. The two methods are used to solve the Vehicle Routing Problem for online shipment of the products in the entire Pangasinan using the data from JRS Express. After applying the two methods to the said problem, it was observed that the Clarke-Wright Method is more economical to use when it comes to Vehicle Routing Problem than Branch & Bound Method.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.