A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem Articles uri icon

publication date

  • November 2014

start page

  • 153

end page

  • 173

issue

  • 1

volume

  • 222

international standard serial number (ISSN)

  • 0254-5330

electronic international standard serial number (EISSN)

  • 1572-9338

abstract

  • The Split Delivery Vehicle Routing Problem (SDVRP) is a variant of the classical Capacitated Vehicle Routing Problem where multiple visits to each customer are allowed. It is an NP-hard problem where exact solutions are difficult to obtain in a reasonable time. This paper shows a tabu search heuristic with granular neighborhood called Randomized Granular Tabu Search that uses a tabu search technique in a bounded neighborhood (granular) defined by the most promising arcs and introduces some new local operators in the local granular tabu search. The algorithm also uses a random selection of the move to be introduced at the current solution. In addition, the local search procedures can explore infeasible neighborhoods in terms of vehicle capacity. These two ideas help to escape from local optima. After the local search process, the algorithm solves one traveling salesman problem per route to improve the solution. Finally, a computational study shows that the proposed method improves many of the best-known solutions for the benchmark instances of the SDVRP literature.

keywords

  • vehicle routing problem; split deliveries; tabu search; granular neighborhood; column generation approach; algorithm