Vehicle Routing Problem - A Case Study Of Lidole Company In Gia Lai

Abstract

The vehicle routing problem with time windows (VRPTW) is a variant of the vehicle routing problem (VRP). In this project, a model of multi-trip vehicle routing with time windows and the potential use of a less-than-truckload carrier is proposed. It will reduce total cost or total travel distance, minimize the total of less-than-truckload carrier while still meeting constraints like capacity and time windows. Based on VRPTW theory, the report focuses on the problem of Lidole Manufacturer. The goal of this study is to determine the optimal travel distance between customers. Furthermore, it still meets customer demand, the opening time at each node, and does not exceed truck capacity. CPLEX solve with MILP was a tool for determining the precise solution. Furthermore, Constraint Programming in CPLEX was used to find the best solution with realize scale. Then, sensitivity analysis will be conducted to find the suitable parameter and strategy for recommendation.