Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Frames

The Vehicle Routing Problem with Time Window is a classic combinatorial optimization problem, relevant in complex logistics applications. Its objective is to determine minimum cost routes for a fleet of vehicles, serving customers with known demands. In this work, we propose a hybrid genetic algorithm that combines the I1 constructive heuristic, evolutionary operators and local search to refine the solutions. The method was evaluated in Solomon instances, considering two variants (with and without local search) to analyze its impact. The results show that the approach, especially with local search, produces high-quality solutions, with low deviations from the best known solutions