Um algoritmo branch-and-price e GRASP para uma variante do problema de roteamento de veículos

Abstract

This work introduces a novel variant of the classical Vehicle Routing Problem and presents an exact and heuristic approach for its resolution. An Integer Linear Programming model integrated with an exact Branch-and-Price algorithm was developed. Additionally, the GRASP metaheuristic was employed to complement the exact algorithm in situations where a feasible integer solution was not found within the time limit. The analysis of the results highlights the feasibility of the proposed methodology for small instances and suggests improvements to address more complex instances.