The vehicle routing problem with divisible deliveries and pickups

Transportation Science

Volumn 49, Issue 2, 2015, Pages 271-294

  Nagy, Gábor ^a   Wassan, Niaz A ^a   Speranza, M Grazia ^b   Archetti, Claudia ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Divisible deliveries and pickups; Metaheuristics; Tabu search; Vehicle routing

Indexed keywords

INTEGER PROGRAMMING; LOGISTICS; NETWORK ROUTING; ROUTING ALGORITHMS; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLES; META HEURISTICS; MIXED INTEGER LINEAR PROGRAMMING PROBLEMS; PICKUP AND DELIVERY; PROBLEM STRUCTURE; REVERSE LOGISTICS; VEHICLE ROUTING PROBLEMS;

PICKUPS;

EID: 84929578653     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2013.0501     Document Type: Article

References (30)

1. Anily S (1996) The vehicle routing problem with delivery and backhaul options. Naval Res. Logist. 43:415-434.
2. Archetti C, Speranza MG (2008) The split delivery vehicle routing problem: A survey. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 103-122.
3. Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Internat. Trans. Oper. Res. 39:3-22.
4. Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40:226-234.
5. Archetti C, Savelsbergh MWP, Speranza MG (2008) To split or not to split: That is the question. Transportation Res. Part E 44: 114-123.
6. Battiti R, Brunato M, Mascia F (2008) Reactive Search and Intelligent Optimization (Springer, Berlin).
7. Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15:1-31.
8. Christofides N, Eilon S (1969) An algorithm for the vehicle routing dispatching problem. Oper. Res. Quart. 20:309-318.
9. Dror M, Trudeau P (1989) Savings by split delivery routing. Transportation Sci. 23:141-145.
10. Gribkovskaia I, Laporte G, Shyshou A (2008) The single vehicle routing problem with deliveries and selective pickups. Comput. Oper. Res. 35:2908-2924.
11. Gribkovskaia I, Halskau Ø, Laporte G, Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 180:568-584.
12. Halskau Ø, Gribkovskaia I, Myklebost KNB (2001) Models for pickup and deliveries from depots with Lasso solutions. Stefansson G, Tilanus B, eds. Proc. 13th Annual Conf. Logist. Res. NOFOMA 2001 (Chalmers University of Technology, Göteborg, Sweden), 279-293.
13. Hoff A, Løkketangen A (2006) Creating Lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search. Central Eur. J. Oper. Res. 14:125-140.
14. Hoff A, Laporte G, Løkketangen A, Gribkovskaia I (2009) Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 192:755-766.
15. Mitra S (2005) An algorithm for the generalized vehicle routing problem with backhauling. Asia-Pacific J. Oper. Res. 22: 153-169.
16. Mitra S (2008) A parallel clustering technique for the vehicle routing problem with split deliveries and pickups. J. Oper. Res. Soc. 59:1532-1546.
17. Mosheiov G (1994) The travelling salesman problem with pick-up and delivery. Eur. J. Oper. Res. 79:299-310.
18. Mosheiov G (1998) Vehicle routing with pickup and delivery: Tourpartitioning heuristics. Comput. Indust. Engrg. 34:669-684.
19. Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162:126-141.
20. Nagy G, Wassan NA, Salhi S (2013) The vehicle routing problem with restricted mixing of deliveries and pickups. J. Scheduling 16:199-213.
21. Nowak M, Ergun Ö, White CC (2008) Pickup and delivery with split loads. Transportation Sci. 42:32-43.
22. Nowak MA, Ergun Ö, White CC (2009) An empirical study on the benefit of split loads with the pickup and delivery problem. Eur. J. Oper. Res. 198:734-740.
23. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. Part I: Transportation between customers and depot. J. Betriebswirtschaft 58:21-51.
24. Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50:1034-1042.
25. Tarantilis CD, Anagnostopoulou AK, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transportation Sci. 47:356-379.
26. Thangiah SR, Fergany A, Awan S (2007) Real-time split-delivery pickup and delivery time window problems with transfers. Central Eur. J. Oper. Res. 15:329-349.
27. Toth P, Vigo D (2002) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).
28. Wassan NA (2007) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J. Oper. Res. Soc. 58:1630-1641.
29. Wassan NA, Nagy G, Ahmadi S (2008) A heuristic method for the vehicle routing problem with mixed deliveries and pickups. J. Scheduling 11:149-161.
30. Wassan NA, Wassan AH, Nagy G (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Combin. Optim. 15:368-386.