Skip to main content
SpringerLink
Log in

A reactive tabu search for the vehicle routing problem

  • Technical Note
  • Published:
Journal of the Operational Research Society

Abstract

The classical vehicle routing problem (VRP) involves determining a fleet of homogeneous size vehicles and designing an associated set of routes that minimizes the total cost. Our tabu search (TS) algorithm to solve the VRP is based on reactive tabu search (RTS) with a new escape mechanism, which manipulates different neighbourhood schemes in a very sophisticated way in order to get a balanced intensification and diversification continuously during the search process. We compare our algorithm with the best methods in the literature using different data sets and report results including new best known solutions for several well-known 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

  • Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews: the state of the art. Comput Opns Res 10: 63–211.

    Article  Google Scholar 

  • Laporte G and Osman I H (1995). Routing problems. A bibliography. Ann Opns Res 61: 227–262.

    Article  Google Scholar 

  • Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512–522.

    Article  Google Scholar 

  • Laporte G, Gendreau M, Potvin J-Y and Semet F (2000). Classical and modern heuristics for the vehicle routing problem. Int Trans Opl Res 7: 285–300.

    Article  Google Scholar 

  • Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opns Res 41: 421–451.

    Article  Google Scholar 

  • Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276–1290.

    Article  Google Scholar 

  • Taillard ED (1993). Parallel iterative search methods for the vehicle routing problems. Networks 23: 661–676.

    Article  Google Scholar 

  • Rego C and Roucairol C (1996). A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman IH and Kelly JP (eds). Metaheuristics: Theory & Applications. Kluwer, Boston, MA, pp 661–675.

    Google Scholar 

  • Xu J and Kelly JP (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transp Sci 30: 379–393.

    Article  Google Scholar 

  • Noon CE, Mittenthal J and Pillai R (1994). A TSSP + 1 decomposition strategy for the vehicle routing problem. Eur J Opl Res 79: 524–536.

    Article  Google Scholar 

  • Fisher ML (1994). Optimal solution of vehicle routing problems using minimum k-trees. Opns Res 42: 626–646.

    Article  Google Scholar 

  • Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search vehicle routing. J Heuristics 1: 147–167.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568–581.

    Article  Google Scholar 

  • Salhi S and Rand GK (1987). Improvements to vehicle routing heuristics. J Opl Res Soc 38: 293–295.

    Article  Google Scholar 

  • Salhi S and Rand GK (1993). Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Opl Res 66: 313–330.

    Article  Google Scholar 

  • Battiti R and Tecchiolli G (1994). The reactive tabu search. ORSA J Comput 6: 126–140.

    Article  Google Scholar 

  • Juliff P (1990). Program Design, 3rd edn. Prentice-Hall: Australia.

    Google Scholar 

  • 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. Wiley, Chichester, pp 431–448.

    Google Scholar 

  • Russell A (1977). An effective heuristic for the M-tour travelling salesman problem with some side constraints. Opns Res 25: 517–524.

    Article  Google Scholar 

  • Gendreau M, Hertz A and Laporte G (1991). A tabu search heuristic for the vehicle routing problem. Working paper, CRT-777, Centre de recherche sur les transports, Université de Montréal.

    Google Scholar 

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

    Article  Google Scholar 

  • Laporte G (1992). The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 345–358.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kent, Canterbury, UK

    N A Wassan

Authors
  1. N A Wassan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N A Wassan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wassan, N. A reactive tabu search for the vehicle routing problem. J Oper Res Soc 57, 111–116 (2006). https://doi.org/10.1057/palgrave.jors.2601957

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601957

Keywords

Search

Navigation