Problema de roteamento de veículos aplicado ao problema de despacho de ordens de serviço

Abstract

The vehicle routing problem is a problem widely studied in the field of combinatorial optimization because it has a great scientific and practical relevance. The need for optimization of logistics systems is necessary to improve the resolution techniques especially when the issues involved are real. For the resemblance to the vehicle routing problem, the problem of dispatch service order is addressed in this work as one of its possible variations. This paper examines the main approaches heuristics and meta-heuristics for solving the routing problem and propose a local search algorithm applied to any of its variants. Finally, we analyze these approaches in order to measure which may one day be applied more successfully to the problem of dispatch service order.