Genils-TS-CL-PR : um algoritmo heurístico para resolução do problema de roteamento de veículos com coleta e entrega simultânea.

Abstract

This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We propose the algorithm GENILS-TS-CL-PR for solving it. This algorithm combines the heuristic procedures Cheapest In- sertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relin king (PR). The first three procedures aim to obtain a good initial solution, and the VND and TS are used as local search methods for ILS. TS is applied after some iterations without any improvement through of the VND. The PR procedure is performed for each ILS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm also uses a strategy to re- duce the number of solutions evaluated in the solution space. It was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.