Networks and Spatial Economics

, Volume 16, Issue 3, pp 743–768 | Cite as

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot



In this paper we study the one commodity pickup-and-delivery traveling salesman problem with restricted depot (1-PDTSP-RD), which is a generalization of the classical traveling salesman problem (TSP). We first introduce a polynomial size integer programming formulation for the problem and then study the feasibility issue which is shown to be \(\mathcal {NP}\)-complete by itself. In particular, we prove sufficient conditions for the feasibility of the problem and provide a polynomial algorithm to find a feasible solution. We also develop a bound on the cost of the 1-PDTSP-RD solution in terms of the cost of the TSP solution. Based on this bound, we provide a heuristic algorithm to solve the 1PDTSP-RD. Extensive numerical experiments are performed to evaluate the efficiency of both the exact and approximation algorithms.


Traveling salesman Pickup and delivery Capacitated vehicle 


  1. Anily S, Bramel J (1999) Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res Logist 46:654–670CrossRefGoogle Scholar
  2. Anily S, Gendreau M, Laporte G (1999) The swapping problem on a line. SIAM J Comput 29:327–335CrossRefGoogle Scholar
  3. Anily S, Hassin R (1992) The wwapping problem. Networks 22:419–433CrossRefGoogle Scholar
  4. Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11–18CrossRefGoogle Scholar
  5. Blanco V, Carpente L, Hinojosa Y, Puerto J (2010) Planning for agricultural forage harvesters and trucks: model, heuristics, and case study. Netw Spat Econ 10:321–343CrossRefGoogle Scholar
  6. Battarra M, Erdogan G, Laporte G, Vigo D (2010) The traveling salesman problem with pickups, deliveries, and handling costs. Trans Sci 44:383–399CrossRefGoogle Scholar
  7. Campbell AM, Thomas BW (2008) Probabilistic traveling salesman problem with deadlines. Trans Sci 42:1–21CrossRefGoogle Scholar
  8. Chalasani P, Motwani R (1999) Approximating capacitated routing and delivery problems. SIAM J Comput 28:2133–2149CrossRefGoogle Scholar
  9. Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh, PAGoogle Scholar
  10. Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Trans Sci 39:188–205CrossRefGoogle Scholar
  11. Guan DJ (1998) Routing a vehicle of capacity greater than one. Discret Appl Math 81:41–57CrossRefGoogle Scholar
  12. Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126:106–130CrossRefGoogle Scholar
  13. Helsgaun K (2009) General k-opt submoves for the Lin-Kernighan TSP heuristic. Math Program Comput 1:119–163CrossRefGoogle Scholar
  14. Hernandez-Perez H, Salazar-Gonzalez J (2002) The one-commodity pickup-and-delivery traveling salesman problem. Lect Notes Comput Sci 2570:89–104CrossRefGoogle Scholar
  15. Hernandez-Perez H, Salazar-Gonzalez J (2004a) A branch-and-cut algorithm for a traveling salesman problem With pickup and delivery. Discret Appl Math 145:126–139CrossRefGoogle Scholar
  16. Hernandez-Perez H, Salazar-Gonzalez J (2004b) Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Trans Sci 38:245–255CrossRefGoogle Scholar
  17. Hernandez-Perez H, Salazar-Gonzalez J (2007) The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 50:258–272CrossRefGoogle Scholar
  18. Hernandez-Perez H, Rodrguez-Martn I, Salazar-Gonzalez J (2009) A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput Oper Res 36:1639–1645CrossRefGoogle Scholar
  19. Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization. In: Aarts EJL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, ChichesterGoogle Scholar
  20. Larsen A, Madsen OBG, Solomon MM (2004) The a priori dynamic traveling salesman problem with time windows. Trans Sci 38:459–472CrossRefGoogle Scholar
  21. Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245–2269CrossRefGoogle Scholar
  22. Lin S, Kernighan BW (1971) An effective heuristic algorithm for the traveling salesman problem. Bell Telephone Laboratories, Incorporated, Murray HillGoogle Scholar
  23. Louveaux F, Salazar-Gonzalez J (2008) On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. Math Program 119:168–194Google Scholar
  24. Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesan problems. ACM J 7:326–329CrossRefGoogle Scholar
  25. Mirmohammadsadeghi S, Ahmed S (2015) Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows. Networks and spatial economics in press. doi: 10.1007/s11067-014-9282-2
  26. Mitrovic-Minic S, Krishnamurtia R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Trans Res Part B: Methodol 38:669–685CrossRefGoogle Scholar
  27. Mladenovíc M, Uroševíc D, Hafani S, Ilíc A (2012) A general variable neighborhood search for the one-commodity pickup-and-delivery traveling salesman problem. Eur J Oper Res 220:270–285CrossRefGoogle Scholar
  28. Mosheiov G (1994) The travelling salesman problem with pick-up and deliveries. Eur J Oper Res 79:299–310CrossRefGoogle Scholar
  29. Norouzi N, Tavakkoli-Moghaddam R, Ghazanfari M, Alinaghian M, Salamatbakhsh A (2012) A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization. Netw Spat Econ 12:609–633CrossRefGoogle Scholar
  30. Psaraftis H (1983) Analysis of an O(n 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Trans Res Part B: Methodol 17:133–145CrossRefGoogle Scholar
  31. Raviv T, Tzur M, Forma IA (2012) Static repositioning in a bike-sharing system: models and solution approaches. EURO J Trans Logist:1–43Google Scholar
  32. Real data from Velo bike-share system, Antwerpen, Belgium (accesss 2011)
  33. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285–305CrossRefGoogle Scholar
  34. Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Trans Sci 29:17–29CrossRefGoogle Scholar
  35. Wang F, Lim A, Xu Z (2006) The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48:24–35CrossRefGoogle Scholar
  36. Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Trans Res Part B: Methodol 26:97–112CrossRefGoogle Scholar
  37. Yan S, Hsiao FY, Chen YC (2015) Inter-school bus scheduling under stochastic travel times. Networks and spatial economics in press. doi: 10.1007/s11067-014-9280-4
  38. Zhang J, Lam WHK, Chen BY (2013) A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service. Netw Spat Econ 13:471–496CrossRefGoogle Scholar
  39. Zhao F, Li S, Sun J, Mei D (2009) Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput Ind Eng 56:1642–1648CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.School of Civil EngineeringPurdue UniversityWest LafayetteUSA

Personalised recommendations