Application of Metaheuristics for Multi-Trip Capacitated Vehicle Routing Problem with Time Window

This study focuses on the delivery routing problem faced by a transport company located in Phuket, Thailand. The goal of this study is to find a daily optimum route in order to minimize the total transportation cost, which comprises fixed costs associated with vehicle rental and variable costs calculated based on factors of travel distance, fuel prices, and fuel consumption. The complexity of this problem is compounded by the fact that customer demand often exceeds a vehicle capacity, in terms of weight and volume. In addition, delivery must be made within specific time windows. To tackle this issue, the delivery routing problem is classified as a multi-trip capacitated vehicle routing problem with time window (MTCVRPTW). Since the problem is NP-hard, an application of metaheuristic is more practical to determine the delivery routing of the company within a reasonable computing time. In this study, Particle Swarm Optimization (PSO) and Differential Evolution (DE) algorithm are applied to solve MTCVRPTW. The numerical results show that DE provides better solution quality compared to those obtained from PSO and company current practices.