An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time.

[1]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[2]  Shaul P. Ladany,et al.  OPTIMAL ROUTING OF A SINGLE VEHICLE WITH LOADING AND UNLOADING CONSTRAINTS , 1984 .

[3]  Anand Subramanian,et al.  New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, SEA.

[4]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[5]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

[6]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[7]  Puca Huachi Vaz Penna,et al.  An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem , 2013, J. Heuristics.

[8]  Roberto Baldacci,et al.  An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.

[9]  Gur Mosheiov,et al.  The traveling salesman problem with delivery and backhauls , 1994, Oper. Res. Lett..

[10]  Gilbert Laporte,et al.  The pickup and delivery traveling salesman problem with first-in-first-out loading , 2009, Comput. Oper. Res..

[11]  Juan José Salazar González,et al.  The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms , 2007, Networks.

[12]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[13]  Juan José Salazar González,et al.  The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.

[14]  Daniele Vigo,et al.  Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs , 2012, Comput. Oper. Res..

[15]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[16]  Andrea Roli,et al.  Leveraging saving-based algorithms by master-slave genetic algorithms , 2011, Eng. Appl. Artif. Intell..

[17]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[18]  Gur Mosheiov,et al.  The Travelling Salesman Problem with pick-up and delivery , 1994 .

[19]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[20]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[21]  Gilbert Laporte,et al.  The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..

[22]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[23]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[24]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[25]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[26]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[27]  Juan-José Salazar-González,et al.  The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .

[28]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[29]  Temel Öncan,et al.  A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem , 2005, J. Oper. Res. Soc..

[30]  Fanggeng Zhao,et al.  A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery , 2009, Int. J. Autom. Comput..