Advertisement

One-to-Many-to-One Single Vehicle Pickup and Delivery Problems

Chapter
Part of the Operations Research/Computer Science Interfaces book series (ORCS, volume 43)

Summary

In One-to-Many-to-One Single Vehicle Pickup and Delivery Problems a vehicle based at the depot must make deliveries and pickups at customers locations before returning to the depot. Several variants can be defined according to the demand structures and sequencing rules imposed on pickups and deliveries. In recent years there has been an increased interest in this family of problems. New formulations and efficient heuristics capable of yielding general solutions (unrestricted in shape) have been proposed. In addition, some new and interesting extensions have been analyzed, including problems with selective pickups and problems with capacitated customers. The purpose of this chapter is to review these developments.

Key words

Pickups and deliveries clustered traveling salesman problem backhauls lasso double-path general solutions reverse logistics selective pickups transshipment capacitated customers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alshamrani A, Mathur K, and Ballou RH (2007) Reverse logistics: Simultaneous design of delivery routes and returnstrategies.Computers & Operations Research 34:595–619CrossRefGoogle Scholar
  2. 2.
    Anily S and Hassin R (1992) The swapping problem.Networks 22:419–433CrossRefGoogle Scholar
  3. 3.
    Anily S and Mosheiov G (1994) The traveling salesman problem with delivery and backhauls.Operations Research Letters 16:11–18CrossRefGoogle Scholar
  4. 4.
    Baldacci R, Hadjiconstantinou EA, and Mingozzi A (2003) An exact algorithm for the traveling salesman problem with deliveries and collections.Networks 42:26–41CrossRefGoogle Scholar
  5. 5.
    Berbeglia G, Cordeau J-F, Gribkovskaia I, and Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey.TOP 15:1–31CrossRefGoogle Scholar
  6. 6.
    Chisman JA (1975) The clustered traveling salesman problem.Computers & Operations Research 2:115–118CrossRefGoogle Scholar
  7. 7.
    Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Research report 388, G.S.I.A., Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
  8. 8.
    Cordeau J-F, Gendreau M, and Laporte G (1997) A tabu search algorithm for periodic and multi-depot vehicle routing problems.Networks 30:105–119CrossRefGoogle Scholar
  9. 9.
    Cordeau J-F, Laporte G, and Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows.Journal of the Operational Research Society 52:928–936CrossRefGoogle Scholar
  10. 10.
    Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.Operations Research Letters 10:27–36CrossRefGoogle Scholar
  11. 11.
    Dethloff J (2001) Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up.Operations Research Spectrum 23:79–96CrossRefGoogle Scholar
  12. 12.
    Frederickson G, Hecht M, and Kim C (1978) Approximation algorithms for some routing problems.SIAM Journal on Computing 7:178–193CrossRefGoogle Scholar
  13. 13.
    Gendreau M, Hertz A, and Laporte G (1996) The traveling salesman problem with backhauls.Computers & Operations Research 23:501–508CrossRefGoogle Scholar
  14. 14.
    Gendreau M, Hertz A, and Laporte G (1997) An approximation algorithm for the traveling salesman problem with backhauls.Operations Research 45:639–641Google Scholar
  15. 15.
    Gendreau M, Laporte G, and Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery.Computers & Operations Research 26:699–714CrossRefGoogle Scholar
  16. 16.
    Golden BL, Bodin LD, Doyle T, and Stewart WR Jr (1980) Approximate travelling salesman algorithms.Operations Research 28:694–711CrossRefGoogle Scholar
  17. 17.
    Gribkovskaia I, Halskau sr Ø, Laporte G, and Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries.European Journal of Operational Research 180:568–584CrossRefGoogle Scholar
  18. 18.
    Gribkovskaia I, Laporte G, and Shlopak A (2006) A tabu search heuristic for a routing problem arising in the servicing of oil and gas offshore platforms.Journal of the Operational Research Society forthcomingGoogle Scholar
  19. 19.
    Gribkovskaia I, Laporte G, and Shyshou A (2007) The single vehicle routing problem with deliveries and selective pickups.Computers & Operations Research forthcomingGoogle Scholar
  20. 20.
    Hernández-Perez H and Salazar-González JJ (2004a) Heuristics for the one-commodity pickup and delivery traveling salesman problem.Transportation Science 38:245–255CrossRefGoogle Scholar
  21. 21.
    Hernández-Perez H and Salazar-González JJ (2004b) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.Discrete Applied Mathematics 145:126–139CrossRefGoogle Scholar
  22. 22.
    Mitrović-Minić S and Laporte G (2006) The pickup and delivery problem with time windows and transshipment.INFOR 44:217–227Google Scholar
  23. 23.
    Mladenović N and Hansen P (1997) Variable neighborhood search.Computers & Operations Research 24:1097–1100CrossRefGoogle Scholar
  24. 24.
    Mosheiov G (1994) The travelling salesman problem with pick-up and delivery.European Journal of Operational Research 79:299–310CrossRefGoogle Scholar
  25. 25.
    Nagy G, and Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries.European Journal of Operational Research 162:126–141CrossRefGoogle Scholar
  26. 26.
    Privé J, Renaud J, Boctor FF, and Laporte G (2006) Solving a vehicle routing problem arising in soft drink distribution.Journal of the Operational Research Society 57:1045–1052CrossRefGoogle Scholar
  27. 27.
    Süral H and Bookbinder JH (2003) The single-vehicle routing problem with unrestricted backhauls.Networks 41:127–136CrossRefGoogle Scholar
  28. 28.
    Tang FA and Galvão RD (2002) Vehicle routing problems with simultaneous pick-up and delivery service.Opsearch 39:19–33Google Scholar
  29. 29.
    Tang FA and Galvão RD (2006) A tabu search algorithm for the vehicle routing probem with simultaneous pick-up and delivery service.Computers & Operations Research 33:595–619CrossRefGoogle Scholar
  30. 30.
    Wasner M and Zäphel G (2004) An integrated multi-depot hub-location vehicle routing model for network planning of parcel service.International Journal of Production Economics 90:403–419CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Molde University CollegeNorway
  2. 2.Canada Research Chair in Distribution Management and GERADHEC MontréalMontréal

Personalised recommendations