Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery

Journal of the Operational Research Society

Volumn 61, Issue 10, 2010, Pages 1498-1509

  Gajpal, Y ^a   Abad, P ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

combinatorial optimization; heuristic; pickup and delivery; vehicle routing

Indexed keywords

EID: 77956928342     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.83     Document Type: Article

References (31)

1. Alshamrani A, Mathur K and Ballou HR (2007). Reverse logistics: Simulation design of delivery routes and returns strategies. Comput Opns Res 34: 595-619.
2. Altinkemer K and Gavish B (1991). Parallel savings based heuristics for the delivery problem. Opns Res 39: 456-469.
3. Bianchessi N and Righini G (2007). Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Opns Res 34: 578-594.
4. Casco DO and Golden BEA (1988). Wasil: Vehicle routing with backhauls: Models, algorithms and case studies. In: Golden BL and Assad AA (eds). Vehicle Routing: Method and Studies. Elsevier: Amsterdam, pp 127-147.
5. Chen JF and Wu TH (2006). Vehicle routing problem with simultaneous deliveries and pickups. J Opl Res Soc 57: 579-587.
6. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. John Wiley: Chichester, UK, pp 315-318.
7. Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
8. Cordeau JF, Gendreau M, Laporte G, Potvin JY and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
9. Crispim J and Brandão J (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J Opl Res Soc 56: 1296-1302.
10. Deif I and Bodin L (1984). Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Babson Conference on Software uses in Transportation and Logistic Management. Babson Park: MA, pp 75-96.
11. Dell'Amico M, Righini G and Salani M (2006). A branch-andprice approach to the vehicle routing problem with simultaneous distribution and collection. Transport Sci 40: 235-247.
12. Desrochers M and Verhoog TW (1989). A matching based savings algorithm for the vehicle routing problem. Technical Report Cahiers du GERAD, G-89-104
13. Dethloff J (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektr 23: 79-96.
14. De Koster RBM, De Brito MP and van de Vendel M (2002). Return handling: an exploratory study with nine retailer warehouses. Int J Retail Distrib Mng 30: 407-421.
15. Edmonds J (1965). Maximum matching and a polyhedron with 0, 1-vertices. J Res Nat Bur Stand 69: 125-130.
16. Gajpal Y (2008). Algorithms for vehicle routing problem with pickup and Delivery. PhD Thesis, DeGroote School of Business, McMaster University Hamilton, Canada.
17. Golden B, Baker E, Alfaro J and Schaffer J (1985). The vehicle routing problem with backhauling: Two approaches. In: Hammesfahr RD (ed). Proceedings of the XXI Annual meeting of S.E. Times, Myrtle Beach, USA, pp 90-92.
18. Irnich S (2008). Resource extension functions: Properties, inversion, and generalization to segments. OR Spectr 30: 113-148.
19. Johnson DS, Aragon CR, McGeogh LA and Schevon C (1989). Optimization by simulated annealing: An experimental evaluation: Part 1, Graph Partitioning. Opns Res 37: 865-891.
20. Kindervater GAP and Savelsbergh MWP (1997). Vehicle routing: handling edge exchanges. In: Aarts EH and Lenstra JK (eds). Local Search in Combinatorial Optimization. John Wiley & Sons: Chichester: UK. pp 337-360.
21. Lin S (1965). Computer solutions to the travelling salesman problem. Bell Sys Technol J 44: 2245-2269.
22. Min HK (1989). The multiple vehicle-routing problem with simultaneous delivery and pick-Up points. Transport Res Part A Policy Pract 23: 377-386.
23. Montane FAT and Galvao RD (2005). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Opns Res 33: 595-619.
24. Mosheiov G (1998). Vehicle routing with pick-up and delivery: Tourpartitioning heuristics. Comput Indust Eng 34: 669-684.
25. Nagy G and Salhi S (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Opl Res 162: 126-141.
26. Papadimitriou CH and Steiglitz K (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice Hall Inc.: Upper Saddle River, NJ.
27. Ropke S and Pisinger D (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Opl Res 171: 750.
28. Salhi S and Nagy G (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Opl Res Soc 50: 1034-1042.
29. Wade AC and Salhi S (2004). An ant system algorithm for the mixed vehicle routing problem with backhauls. In: Resende MG, de Sousa JP and Viana A (eds). Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers: Dordrecht, pp 699-719.
30. Wassan NA, Wassan AH and Nagy G (2008). A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15: 368-386.
31. Yellow PC (1970). A computational modification to the savings method of vehicle scheduling. Opl Res Q 21: 281-283.