Minimizing Empty Backhaul For Vehicle Routing Problems With Time Windows: A Case Study Of Tan Cang Company

Abstract

The vehicle routing problem with time windows (VRPTW) is an extension of the vehicle routing problem (VRP). It will minimize total cost or travel distance while satisfying constraints such as capacity and time windows. The research focuses on the problem of Tan Cang Company based on VRPTW theory. This research aims to investigate and propose practical strategies for minimizing the empty backhaul in the vehicle routing problem with time window constraints. Besides, it still addresses the challenge of optimizing transportation operations by reducing unproductive trips and maximizing resource utilization. CPLEX programming was a tool to find the exact solution. In addition, PyCharm software was used to find the optimal solution through the theory of Greedy Algorithm (GA) and Clarke and Wright Savings Algorithm (CWSA). Then, a comparison between the exact solution and the optimal solution was performed.