A parallel clustering technique for the vehicle routing problem with split deliveries and pickups

Journal of the Operational Research Society

Volumn 59, Issue 11, 2008, Pages 1532-1546

  Mitra, S ^a  

^a INDIAN INSTITUTE OF MANAGEMENT CALCUTTA   (India)

Author keywords

Backhauling; Heuristics; Parallel clustering; Split deliveries; Vehicle routing

Indexed keywords

CLUSTER ANALYSIS; INTEGER PROGRAMMING; VEHICLE ROUTING; VEHICLES;

BACKHAULING; HEURISTICS; OBJECTIVE FUNCTIONS; PARALLEL CLUSTERING; PARAMETRIC CONDITIONS; SPLIT DELIVERY; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

PICKUPS;

EID: 53349109860     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602500     Document Type: Article

References (31)

1. Anily S (1996). The vehicle routing problem with delivery and backhaul options. Nav Res Logist 43: 415-434.
2. Archetti C, Speranza MG and Hertz A (2006a). A tabu search algorithm for the split delivery vehicle routing problem. Transport Sei 40: 64-73.
3. Archetti C, Savelsbergh MWP and Speranza MG (2006b). Worst-case analysis for split delivery vehicle routing problems. Transport Sei 40: 226-234.
4. Belenguer JM, Martinez MC and Mota E (2000). A lower bound for the split delivery vehicle routing problem. Opns Res 48: 801-810.
5. Brandão J (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. Eur J Opl Res 173: 540-555.
6. Casco DO, Golden BL and Wasil EA (1988). Vehicle routing with backhauls; models, algorithms, and case studies. In: Golden L and Assad A (eds). Vehicle Routing: Methods and Studies. North Holland: Amsterdam, pp 127-147.
7. Chen JF and Wu TH (2006). Vehicle routing problem with simultaneous deliveries and pickups. J Opl Res Soc 57: 579-587.
8. Deif I and Bodin L (1984). Extension of the Clark and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Conference on Computer Software Uses in Transportation and Logistics Management. Babson Park: MA: USA, pp 75-96.
9. Dethloff J (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pickup. OR Spektrum 23: 79-96.
10. Dethloff J (2002). Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pickup applied to the vehicle routing problem with backhauls. J Opl Res Soc 53: 115-118.
11. Dror M and Trudeau P (1989). Savings by split delivery routing. Transport Sci 23: 141-149.
12. Dror M and Trudeau P (1990). Split delivery routing. Nav Res Logist 37: 383-402.
13. Dror M, Laporte G and Trudeau P (1994). Vehicle routing with split deliveries. Disc Appl Math 50: 239-254.
14. Duhamel C, Potvin JY and Rousseau JM (1997). A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transport Sci 31: 49-59.
15. Frizzell PW and Giffin JW (1992). The bounded split delivery vehicle routing problem with grid network distances. Asia-Pacific J Opl Res 9: 101-116.
16. Frizzell PW and Giffin JW (1995). The split delivery vehicle scheduling problem with time windows and grid network distances. Comput Opns Res 22: 655-667.
17. Goetschalckx M and Jacobs-Blecha C (1989). The vehicle routing problem with backhauls. Eur J Opl Res 42: 39-51.
18. Goon AM, Gupta MK and Dasgupta B (1993). Fundamentals of Statistics, Vol. 1. The World Press Limited: Kolkata.
19. Ho SC and Haugland D (2004). A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Opns Res 31: 1947-1964.
20. Min H (1989). The multiple vehicle routing problem with simultaneous delivery and pickup points. Transport Res 23A: 377-386.
21. Mingozzi A, Giorgi S and Baldacci R (1999). Exact method for the vehicle routing problem with backhauls. Transport Sci 33: 315-329.
22. Mitra S (2005). An algorithm for the generalized vehicle routing problem with backhauling. Asia-Pacific J Opl Res 22: 153-169.
23. Potvin JY, Duhamel C and Guertin F (1996). A genetic algorithm for vehicle routing with backhauling. Appl Intel 6: 345-355.
24. Potvin JY, Xu Y and Benyahia I (2006). Vehicle routing and scheduling with dynamic travel times. Comput Opns Res 33: 1129-1137.
25. 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-775.
26. 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.
27. Tang FA and Galvão RD (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pickup and delivery service. Comput Opns Res 33: 595-619.
28. Thangiah SR, Potvin JY and Sun T (1996). Heuristic approaches to vehicle routing with backhauls and time windows. Comput Opns Res 23: 1043-1057.
29. Toth P and Vigo D (1997). An exact algorithm for the vehicle routing problems with backhauls. Transport Sci 31: 372-385.
30. Toth P and Vigo D (1999). A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Opl Res 113: 528-543.
31. Wade AC and Salhi S (2002). An investigation into a new class of vehicle routing problem with backhauls. Omega 30: 479-487.