Uma abordagem GGVNS aplicada a resolução do problema de roteamento de veículos com coleta e entrega simultânea.

Abstract

In the scenario of the processes of pickup and delivery simultaneous of products and people, a major industrial concern is the establishment of the minimum use of resources and the total distance traveled by the vehicles. In the area of Computational Optimization, surveys classify this scenario as a Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). Given the complexity of solving this problem and the need to obtain better results than existent in the literature, this work proposes the use of a hybrid heuristic strategy composed by Greedy Adaptive Randomized Search Procedure + Variable Neighborhood Search + Variable Neighborhood Descent (GGVNS). The algorithm was tested in consecrated instances in the literature and proved to be efficient for most of these.