Author(s): Sena, Inês ; Ribeiro, Tiago B. ; Silva, Adriano S. ; Fernandes, Florbela P. ; Costa, Lino A. ; Pereira, Ana I.
Date: 2026
Persistent ID: http://hdl.handle.net/10198/35176
Origin: Biblioteca Digital do IPB
Subject(s): Capacitated Vehicle Routing Problem; Optimization; OR-Tools; Time Windows
The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is a significant challenge in combinatorial optimization, with extensive practical applications in logistics and transportation. This study aims to conduct a comparative analysis of the various methods available in OR-Tools for solving the CVRPTW across datasets of different sizes and types using the Solomon and the Gehring and Homberger benchmarks. The analysis provided insights into the relative strengths of each method, with a primary focus on Guided Local Search (GLS) and Tabu Search (TS), showing consistent performance and adaptability to different dataset characteristics. The results indicate that GLS is the most robust method overall, and TS can outperform it in specific scenarios. In conclusion, this study offers insights for selecting the most effective method to solve vehicle routing problems based on the characteristics and scale of the problem.
