A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

Journal of Combinatorial Optimization

Volumn 15, Issue 4, 2008, Pages 368-386

  Wassan, Niaz A ^a   Wassan, A Hameed ^a   Nagy, Gábor ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Heuristic; Pickups and deliveries; Reactive tabu search; Vehicle routing

Indexed keywords

ALGORITHMS; BENCHMARKING; CUSTOMER SATISFACTION; PROBLEM SOLVING; VEHICLE ROUTING;

TABU SEARCH ALGORITHMS; VEHICLE ROUTING PROBLEM WITH PICKUPS AND DELIVERIES (VRPPD);

TABU SEARCH;

EID: 40849139357     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9090-4     Document Type: Article

References (34)

1. Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11-18
2. Battiti R, Tecchioli G (1994) Reactive tabu search. ORSA J Comput 6:126-140
3. Chen J-F, Wu T-H (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57:579-587
4. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315-338
5. Clarke G, Wright J (1964) Scheduling of vehicles for a central depot to a number of delivery points. Oper Res 12:568-581
6. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53:512-522
7. Crispim J, Brandão J (2005) Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J Oper Res Soc 56:1296-1302
8. Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23:79-96
9. Dethloff J (2002) Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J Oper Res Soc 53:115-118
10. Drezner Z (1982) Fast algorithms for the round trip location problem. IEE Trans 14:243-248
11. Fabri A, Recht P (2006) On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Res Part B 40:335-350
12. Gaskell T (1967) Bases for vehicle fleet scheduling. Oper Res Quart 18:281-295
13. Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699-714
14. Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22:340-349
15. Glover F, Laguna M (1997) Tabu search. Kluwer, New York
16. Halse K (1992) Modeling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby
17. Irnich S (2000) A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur J Oper Res 122:310-328
18. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res A 23:377-386
19. Mosheiov G (1994) The traveling salesman problem with pick-up and delivery. Eur J Oper Res 79:299-310
20. Mosheiov G (1995) The pickup delivery location problem on networks. Networks 26:243-251
21. Nagy G (1996) Heuristic methods for the many-to-many location-routing problem. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham
22. 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
23. Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res Part B 34:107-121
24. Osman IH, Wassan NA (2002) A reactive tabu search meta-heuristic for the vehicle routing problem with backhauls. J Sched 5:263-285
25. 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
26. Tang FA, Galvão RD (2006) A tabu search algorithm for the vehicle routing problems with simultaneous pickup and delivery service. Comput Oper Res 33:595-619
27. Thangiah SR, Sun T, Potvin J-Y (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043-1057
28. Toth P, Vigo D (2002) VRP with backhauls. In: Toth P, Vigo D (eds) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, pp 195-224
29. Wade AC (2002) Constructive and ant system heuristics for a class of vehicle routing problems with backhauls. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham
30. Wade AC, Salhi S (2002) An investigation into a new class of vehicle routing problem with backhauls. Omega 30:479-487
31. Wade AC, Salhi S (2003) An ant system algorithm for the mixed vehicle routing problem with backhauls. In: Resende MG, de Sousa JP (eds) Metaheuristics: computer decision-making. Kluwer, New York, pp 699-719
32. Wassan NA (2006a) A reactive tabu search for the vehicle routing problem. J Oper Res Soc 57:111-116
33. Wassan NA (2006b) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J Oper Res Soc (available online)
34. Wassan NA, Osman IH (2002) Tabu search variants for the mix fleet vehicle routing problem. J Oper Res Soc 53:768-782