GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery

Abstract

This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). Due to its complexity, we propose a heuristic algorithm for solving it, so-called GENVNS-TS-CL-PR. This algorithm combines the heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (PR). The first three procedures aim to obtain an good initial solution, and the VND and TS are used as local search methods for VNS. TS is called after some iterations without any improvement through of the VND. The PR procedure is called after each VNS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm uses an strategy based on Candidate List to reduce the number of solutions evaluated in the solution space. The algorithm was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.

A solution approach for vehicle routing problem with simultaneous pickup and delivery

“…Cruz ve ark. (2012) en ucuz yerleştirme, çok yönlü en ucuz yerleştirme, değişken komşu arama, değişken komşu iniş ve yeniden yol arama ve tabu arama algoritmalarından oluşan sezgisel algoritma geliştirmişlerdir [29]. Goksal [31].…”

Description of the classification of publications and the models used in solving of the vehicle routing problem with pickup and delivery

“…Cheapest insertion procedure and tabu search [102] Exact integer programming formulation and heuristic constructive [103] Local search and exact algorithms and heuristic [104] Hybrid algorithm and a packing procedure [105] Algorithms genvns+ts+cl+pr [106] Simulated annealing + particle swarm optimization pso + genetic algorithm + artificial immune system [107] Simulated annealing + variable search local+ probabilistic tabu search [107] Genetic algorithm and tabu [108] Mixed integer program +, adaptive neighborhood search and insertion heuristic [109] Ant colony system based on heuristic algorithm [110] Mixed algorithm pso_acs [111] Source: authors…”

Review of state of the art vehicle routing problem with pickup and delivery (VRPPD)

“…Métodos híbridos MH: búsqueda local y búsqueda tabú: LS y TS [49]; procedimiento de inserción más barato y búsqueda tabú: CIP y TS [50]; programación lineal entera y heurística constructiva: ILP y CH; algoritmos exactos y métodos heurísticos: EA y HME; algoritmos GENVNS, búsqueda tabú con lista de candidatos y PR (encadenamiento de trayectorias) GENVNS-TS-CL-PR [51]; algoritmo genético y búsqueda tabú: GA y TS; programación entera mixta con trayectoria más corta: MILP-SP [48]; búsqueda adaptativa de vecindad y heurística de inserción: En cuanto a las metaheurísticas, el método más empleado es CA.…”