Capacited Vehicle Routing Problem With Time Windows: A Case Study Of Saigon Coop Logistics Company

Abstract

This thesis explores the complex nature of the Capacited Vehicle Routing Problem with Time Windows (CVRPTW), a prominent issue in the field of operations research, logistics, and supply chain management. The CVRPTW involves determining optimal routes for a fleet of vehicles that must deliver to or collect from various locations within specific time windows, making it a critical area of study for enhancing efficiency in delivery and transportation systems. This thesis has developed and implemented several novel computational algorithms aimed at improving the efficiency and scalability of solutions for the CVRPTW. The research delves into various exact methods, Mixed Integer Linear Programming and Branch and Bound approaches, utilizing a combination of techniques. The effectiveness of these algorithms has been evaluated on numerous benchmark problems in the CVRPTW literature, showing significant improvements in both computational time and the quality of the solutions. This research not only provides valuable insights into tackling the CVRPTW but also forms a foundation for future studies aimed at improving logistics operations, thus benefiting industries that rely heavily on timely and efficient deliveries. Cplex optimization (Cplex) will help construct and run the objective functions constraints. In this study, the designed model is applied on Saigon Coop stores located in Thu Duc, District 1,2,3 and 5