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

Operations Research/ Computer Science Interfaces Series

Volumn 43, Issue , 2008, Pages 359-377

  Gribkovskaia, Irina ^a   Laporte, Gilbert ^b  

^a MOLDE UNIVERSITY COLLEGE   (Norway)

^b HEC MONTRÉAL   (Canada)

Author keywords

Backhauls; Capacitated customers; Clustered traveling salesman problem; Double path; General solutions; Lasso; Pickups and deliveries; Reverse logistics; Selective pickups; Transshipment

Indexed keywords

EID: 84888602694     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-77778-8_16     Document Type: Review

References (30)

1. Alshamrani A, Mathur K, and Ballou RH (2007) Reverse logistics: Simultaneous design of delivery routes and return strategies. Computers & Operations Research 34: 595-619.
2. Anily S and Hassin R (1992) The swapping problem. Networks 22: 419-433.
3. Anily S and Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Operations Research Letters 16: 11-18.
4. Baldacci R, Hadjiconstantinou EA, and Mingozzi A (2003) An exact algorithm for the traveling salesman problem with deliveries and collections. Networks 42: 26-41.
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-31.
6. Chisman JA (1975) The clustered traveling salesman problem. Computers & Operations Research 2: 115-118.
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, PA.
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-119.
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-936.
10. Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10: 27-36.
11. Dethloff J (2001) Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. Operations Research Spectrum 23: 79-96.
12. Frederickson G, Hecht M, and Kim C (1978) Approximation algorithms for some routing problems. SIAM Journal on Computing 7: 178-193.
13. Gendreau M, Hertz A, and Laporte G (1996) The traveling salesman problem with backhauls. Computers & Operations Research 23: 501-508.
14. Gendreau M, Hertz A, and Laporte G (1997) An approximation algorithm for the traveling salesman problem with backhauls. Operations Research 45: 639-641.
15. Gendreau M, Laporte G, and Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research 26: 699-714.
16. Golden BL, Bodin LD, Doyle T, and Stewart WR Jr (1980) Approximate travelling salesman algorithms. Operations Research 28: 694-711.
17. Gribkovskaia I, Halskausr Ø, 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-584.
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 forthcoming.
19. Gribkovskaia I, Laporte G, and Shyshou A (2007) The single vehicle routing problem with deliveries and selective pickups. Computers & Operations Research forthcoming.
20. Hernández-Perez H and Salazar-González JJ (2004a) Heuristics for the onecommodity pickup and delivery traveling salesman problem. Transportation Science 38: 245-255.
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-139.
22. Mitrović-Minić S and Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44: 217-227.
23. Mladenović N and Hansen P (1997) Variable neighborhood search. Computers & Operations Research 24: 1097-1100.
24. Mosheiov G (1994) The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 79: 299-310.
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-141.
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-1052.
27. Süral H and Bookbinder JH (2003) The single-vehicle routing problem with unrestricted backhauls. Networks 41: 127-136.
28. Tang FA and Galvão RD (2002) Vehicle routing problems with simultaneous pick-up and delivery service. Opsearch 39: 19-33.
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-619.
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-419.