Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The vehicle routing problem with pickups and deliveries (VRPPD) extends the vehicle routing problem (VRP) by allowing customers to both send and receive goods. The main difficulty of the problem is that the load of vehicles is fluctuating rather than decreasing as in the VRP. We design a reactive tabu search metaheuristic that can check feasibility of proposed moves quickly and reacts to repetitions to guide the search. Several new best solutions are found for benchmark problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Heuristic Optimisation, Kent Business School, The University of Kent, Canterbury, CT2 7PE, UK

    Niaz A. Wassan, A. Hameed Wassan & Gábor Nagy

Authors
  1. Niaz A. Wassan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Hameed Wassan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gábor Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gábor Nagy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wassan, N.A., Wassan, A.H. & Nagy, G. A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15, 368–386 (2008). https://doi.org/10.1007/s10878-007-9090-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9090-4

Keywords

Search

Navigation