Vehicle Routing Problem With Time Window: A Case Study Of Panasonic Viet Nam

Abstract

The vehicle routing problem with time window (VRPWTW) is an expanded version of the vehicle routing problem (VRP) which entails the departure and return of vehicles from a designated depot location, all while ensuring adherence to the working time constraints of the customers. This dissertation presents the development of a model utilizing mixed integer programming for the VRPTW. The VRPTW model, constructed through MILP, is subject to computer tests employing a set of small-scale instances. The MILP formulation of the VRPTW was initially established by Truden et al. (2022), and subsequently enhanced through a novel iteration to gain improved control over the outcomes, ultimately serving as a robust groundwork for future advancements in other VRP-related quandaries. The present study assumes the utilization of MILP algorithms implemented via Cplex. Moreover, the dissertation highlights an instance of a VRPTW predicament encountered by an electrical appliance enterprise, helps minimize the total distance traveled in delivering goods, while also reducing the burden associated with the entire delivery process.