TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up

The reverse logistics problem of the simultaneous distribution of commodities and the collection of reusable empty packages with a single depot and a single vehicle with limited capacity is addressed in this paper. Commodities to be distributed are loaded at the depot and the empty packages are transported back to the depot. This is called the traveling salesman problem with simultaneous delivery and pick-up (TSDP), a variant of the classical traveling salesman problem (TSP), where nodes require both delivery and pick-up. The objective is to minimize the total distance traveled by servicing of the all customers. We develop a mathematical programming model and a two-phase heuristic to solve the TSDP. In the first phase, we use an agglomerative procedure to find an initial solution. In the second phase, we develop an enhanced version of simulated annealing (SA) to search for the best solution. We tested the heuristic on standard, derived, and randomly generated data-sets and obtained encouraging results.

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

[2]  Enrico Angelelli,et al.  The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery , 2002 .

[3]  L. Bodin ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[4]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[5]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[6]  Xiong Chen,et al.  Modeling rolling batch planning as vehicle routing problem with time windows , 1998, Comput. Oper. Res..

[7]  J Dethloff,et al.  Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls , 2002, J. Oper. Res. Soc..

[8]  Spyros A. Reveliotis Conflict resolution in AGV systems , 2000 .

[9]  Yen-Liang Chen,et al.  Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..

[10]  Clarisse Dhaenens-Flipo,et al.  Spatial decomposition for a multi-facility production and distribution problem , 2000 .

[11]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[12]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[13]  Roberto D. Galvão,et al.  Vehicle Routing Problems with Simultaneous Pick-up and Delivery Service , 2002 .

[14]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[18]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[19]  David M. Miller,et al.  A capacitated vehicle routing problem for just-in-time delivery , 1999 .

[20]  L. V. Wassenhove,et al.  Quantitative approaches to distribution logistics and supply chain management , 2002 .

[21]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[22]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[23]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[24]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

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

[26]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[27]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[28]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[29]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..