Optimizing Multi-Trip Capacitated Vehicle Routing Problem With Time Windows: A Case Study Of Giao Hang Tiet Kiem

Abstract

This paper presents a case study of using Local Search (LS) method to minimize the overall travel distance of the Multi-trip Capacitated Vehicle Routing Problem with Time Windows (MTCVRPTW) in the context of Giao hang Tiet kiem, a leading delivery service provider in a large metropolitan area. The MTCVRPTW is a complex optimization problem that involves determining efficient routes and schedules for a fleet of vehicles to deliver goods to customers while respecting capacity constraints and time window requirements. This case study utilizes real-world data obtained from Giao hang Tiet kiem, including customer locations, delivery demands, time windows, vehicle capacities, and travel distances. The LS algorithm is implemented and tailored to the specific requirements of the MTCVRPTW, taking into account the capacity constraints and time window restrictions. The results of the case study demonstrate the effectiveness of the LS approach in minimizing the overall travel distance of Giao hang tiet kiem's delivery operations. By iteratively exploring the search space and making local improvements to the initial solution, the LS algorithm successfully finds a near-optimal solution