Vehicle routing problem with time windows: A case study of Nguyen Tan company

Abstract

Vehicle routing problem with time windows (VRPTW) is an extension of vehicle routing problem (VRP). It will minimize total cost or total travel distance while still satisfy those constraints such as capacity and time windows. The report focuses on the problem of Nguyen Tan Agricultural Plastic Technology Company Limited based on VRPTW theory. The purpose of this research is to find the optimal travel distance between customers. Besides, it still meets the demand of customers, the opening time at each node and not exceed the capacity of truck. CPLEX programming was a tool to find the exact solution. In addition, MATLAB software was used to find the optimal solution through the theory of Genetic Algorithm (GA). Then, the comparison was performed between exact solution and optimal solution. Keywords: vehicle routing problem (VRP); vehicle routing problem with time window (VRPTW); minimize; capacity; time windows; Genetic Algorithm (GA)