IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v79y1994i2p299-310.html
   My bibliography  Save this item

The Travelling Salesman Problem with pick-up and delivery

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. I Gribkovskaia & G Laporte & A Shlopak, 2008. "A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1449-1459, November.
  2. Ganesh, K. & Narendran, T.T., 2007. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up," European Journal of Operational Research, Elsevier, vol. 178(3), pages 699-717, May.
  3. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
  4. Gábor Nagy & Niaz A. Wassan & M. Grazia Speranza & Claudia Archetti, 2015. "The Vehicle Routing Problem with Divisible Deliveries and Pickups," Transportation Science, INFORMS, vol. 49(2), pages 271-294, May.
  5. Chen, Qingfeng & Li, Kunpeng & Liu, Zhixue, 2014. "Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 218-235.
  6. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
  7. Hernández-Pérez, Hipólito & Salazar-González, Juan-José, 2009. "The multi-commodity one-to-one pickup-and-delivery traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 987-995, August.
  8. Roel G. van Anholt & Leandro C. Coelho & Gilbert Laporte & Iris F. A. Vis, 2016. "An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines," Transportation Science, INFORMS, vol. 50(3), pages 1077-1091, August.
  9. Sayarshad, Hamid R. & Gao, H. Oliver, 2020. "Optimizing dynamic switching between fixed and flexible transit services with an idle-vehicle relocation strategy and reductions in emissions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 198-214.
  10. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
  11. T-S Chang & Y-F Liao, 2011. "Routing strategies for integrating forward distribution and reverse collection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 971-981, June.
  12. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
  13. Gerardo Berbeglia & Gilles Pesant & Louis-Martin Rousseau, 2012. "Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis," Transportation Science, INFORMS, vol. 46(3), pages 359-373, August.
  14. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
  15. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
  16. Shoshana Anily & Julien Bramel, 1999. "Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 654-670, September.
  17. Tai-Yu Ma & Sylvain Klein, 2020. "Integrated ridesharing services with chance-constrained dynamic pricing and demand learning," Papers 2001.09151, arXiv.org, revised Jun 2020.
  18. Hipólito Hernández-Pérez & Juan-José Salazar-González, 2004. "Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem," Transportation Science, INFORMS, vol. 38(2), pages 245-255, May.
  19. Gribkovskaia, Irina & Halskau, Oyvind & Kovalyov, Mikhail Y., 2015. "Minimizing takeoff and landing risk in helicopter pickup and delivery operations," Omega, Elsevier, vol. 55(C), pages 73-80.
  20. Arild Hoff & Arne Løkketangen, 2006. "Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(2), pages 125-140, June.
  21. Julia Rieck & Jürgen Zimmermann & Matthias Glagow, 2007. "Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen: Modellierung und heuristische Lösungsverfahren," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(4), pages 365-388, January.
  22. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
  23. Salazar-González, Juan-José & Santos-Hernández, Beatriz, 2015. "The split-demand one-commodity pickup-and-delivery travelling salesman problem," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 58-73.
  24. Gribkovskaia, Irina & Halskau, Oyvind sr. & Laporte, Gilbert & Vlcek, Martin, 2007. "General solutions to the single vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 180(2), pages 568-584, July.
  25. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
  26. Yu, Junfang & Dong, Yuanyuan, 2013. "Maximizing profit for vehicle routing under time and weight constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 573-583.
  27. Hernández-Pérez, Hipólito & Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José, 2016. "A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 44-52.
  28. Joseph Y. J. Chow & Hamid R. Sayarshad, 2016. "Reference Policies for Non-myopic Sequential Network Design and Timing Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1183-1209, December.
  29. Ma, Tai-Yu & Rasulkhani, Saeid & Chow, Joseph Y.J. & Klein, Sylvain, 2019. "A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 417-442.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.