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

Springer Science and Business Media LLC - Tập 15 Số 4 - Trang 368-386 - 2008
Niaz A. Wassan1, A. Hameed Wassan1, Gábor Nagy1
1Centre for Heuristic Optimisation, Kent Business School, The University of Kent, Canterbury, CT2 7PE, UK

Tóm tắt

Từ khóa


Tài liệu tham khảo

Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11–18

Battiti R, Tecchioli G (1994) Reactive tabu search. ORSA J Comput 6:126–140

Chen J-F, Wu T-H (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57:579–587

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

Clarke G, Wright J (1964) Scheduling of vehicles for a central depot to a number of delivery points. Oper Res 12:568–581

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

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

Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23:79–96

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

Drezner Z (1982) Fast algorithms for the round trip location problem. IEE Trans 14:243–248

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

Gaskell T (1967) Bases for vehicle fleet scheduling. Oper Res Quart 18:281–295

Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699–714

Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22:340–349

Glover F, Laguna M (1997) Tabu search. Kluwer, New York

Halse K (1992) Modeling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby

Irnich S (2000) A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur J Oper Res 122:310–328

Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res A 23:377–386

Mosheiov G (1994) The traveling salesman problem with pick-up and delivery. Eur J Oper Res 79:299–310

Mosheiov G (1995) The pickup delivery location problem on networks. Networks 26:243–251

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

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

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

Osman IH, Wassan NA (2002) A reactive tabu search meta-heuristic for the vehicle routing problem with backhauls. J Sched 5:263–285

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

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

Thangiah SR, Sun T, Potvin J-Y (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043–1057

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

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

Wade AC, Salhi S (2002) An investigation into a new class of vehicle routing problem with backhauls. Omega 30:479–487

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

Wassan NA (2006a) A reactive tabu search for the vehicle routing problem. J Oper Res Soc 57:111–116

Wassan NA (2006b) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J Oper Res Soc (available online)

Wassan NA, Osman IH (2002) Tabu search variants for the mix fleet vehicle routing problem. J Oper Res Soc 53:768–782