Skip to main content
SpringerLink
Log in

A new tabu search heuristic for the open vehicle routing problem

  • Case-Oriented Paper
  • Published:
Journal of the Operational Research Society

Abstract

In this paper, another version of the vehicle routing problem (VRP)—the open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, but if they do, it must be by revisiting the customers assigned to them in the reverse order. By exploiting the special structure of this type of problem, we present a new tabu search heuristic for finding the routes that minimize two objectives while satisfying three constraints. The computational results are provided and compared with two other methods in the literature.

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

  • Schrage L (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11: 229–232.

    Article  Google Scholar 

  • Sariklis D and Powell S (2000). A heuristic method for the open vehicle routing problem. J Opl Res Soc 51: 564–573.

    Article  Google Scholar 

  • Brandão J (2004). A tabu search algorithm for the open vehicle routing problem. Eur J Opl Res 157: 552–564.

    Article  Google Scholar 

  • Fu Z and Wright M (1994). Train plan model for British Rail freight services through the Channel Tunnel. J Opl Res Soc 45: 384–391.

    Article  Google Scholar 

  • Li LYO and Fu Z (2002). The school bus routing problem: a case study. J Opl Res Soc 53: 552–558.

    Article  Google Scholar 

  • Syslo MM, Deo N and Kowalik JS (1983). Discrete Optimization Algorithms with Pascal Programs. Prentice-Hall, Inc.: Englewood Cliffs, NJ.

    Google Scholar 

  • Glover F and Laguna M (1993). Tabu search. In: Reeves C (eds). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford, pp 70–141.

    Google Scholar 

  • Gendreau M, Laporte G and Potvin J-Y (2002). Metaheuristics for the Capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA, pp 129–154.

    Google Scholar 

  • Cordeau J-F00, 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 

  • Van Breedam A (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Opns Res 28: 289–315.

    Article  Google Scholar 

  • Lawler EL (1972). A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Mngt Sci 18: 401–405.

    Article  Google Scholar 

  • Li LYO and Eglese R (1996). An interactive algorithm for vehicle routeing for winter-gritting. J Opl Res Soc 47: 217–228.

    Article  Google Scholar 

  • Pureza VM and França PM (1991). Vehicle routing problems via tabu search metaheuristic. Technical Report CRT-347, Centre for Research on Transportation, Montreal, Canada.

  • Osman LH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann of 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 E, Badeau P, Gendreau M, Guertin F and Potvin JY (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31: 170–186.

    Article  Google Scholar 

  • Duhamel C, Potvin JY and Rousseau JM (1997). A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transp Sci 31: 49–59.

    Article  Google Scholar 

  • Cordeau J-F, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52: 928–936.

    Article  Google Scholar 

  • Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N et al (eds). Combinatorial Optimization. Wiley, London, pp 315–338.

    Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by National Natural Science Foundation of China (NSFC, 70071003) and China Scholarship Council. We were also grateful to José Brandão and the two anonymous referees whose comments helped us to improve the presentation of this paper.

Author information

Authors and Affiliations

  1. Central South University, Changsha, P.R. China

    Z Fu

  2. Lancaster University, Lancaster, UK

    R Eglese

  3. The Hong Kong Polytechnic University, Hong Kong, PR China

    L Y O Li

Authors
  1. Z Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R Eglese
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L Y O Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Z Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, Z., Eglese, R. & Li, L. A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 56, 267–274 (2005). https://doi.org/10.1057/palgrave.jors.2601817

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation