Skip to main content
SpringerLink
Log in

A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem

  • Original Paper
  • Published:
Logistics Research

Abstract

One of the most significant problems of supply chain management is the distribution of products between locations. The delivery of goods from a warehouse to local customers is a critical aspect of material logistics. The Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) is a variant of the Vehicle Routing Problem (VRP) that aims to provide service to a specific customer group with minimum cost using a limited number of vehicles. We assume that the number of vehicles is fixed. We must decide how to make the best use of the fixed fleet of vehicles. In this paper we describe a Tabu Search algorithm embedded in the Adaptive Memory (TSAM) procedure to solve the HFFVRP. Computational experiments indicating the performance of the algorithm concerning quality of solution and processing time are reported.

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

Fig. 1

Similar content being viewed by others

References

  1. Eilon S, Watson-Grandy C, Christofides N (1971) Distribution management: mathematical modeling and practical analysis. Hafner, New York

    Google Scholar 

  2. Dantzig G-B, Ramser J-H (1959) The truck dispatching problem. Manage Sci 6(1):80–91

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodin L-D, Golden B-L, Assad A-A, Ball M-O (1983) Routing and scheduling of vehicles and crews. The state of the Art. Comp Oper Res 10:69–211

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):247–291

    Article  Google Scholar 

  6. Laporte G (1993) Computer aided routing CWI tract.75:M.W.P. Savelsbergh Mathematisch Centrum, Amsterdam, 1992, 134 pages, DFL.40.00, ISBN 90 6196 412 1. Eur J Oper Res 71(1):143

    Article  Google Scholar 

  7. Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487–512

    Article  MATH  MathSciNet  Google Scholar 

  8. Golden B-L, Assad A-A, Levy L, Gheysens F-G (1984) The fleet size and mix vehicle routing problem. Comp Oper Res 11(1):49–66

    Article  MATH  Google Scholar 

  9. Gendreau M, Laporte G, Musaraganyi C, Taillard E-D (1999) A Tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comp Oper Res 26:1153–1173

    Article  MATH  Google Scholar 

  10. Choi E, Tcha D-W (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2080–2095

    Article  MATH  Google Scholar 

  11. Salhi S, Sari M, Sadi D, Touati NAC (1992) Adaptation of some vehicle fleet mix heuristics. OMEGA 20:653–660

    Article  Google Scholar 

  12. Osman I-H, Salhi S (1996) Local search strategies for the VFMP. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Modern heuristic search methods. Wiley, New York, pp 131–153

    Chapter  Google Scholar 

  13. Taillard E-D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661–673

    Article  MATH  Google Scholar 

  14. Taillard E-D, Rochat Y (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147–167

    Article  MATH  Google Scholar 

  15. Taillard E-D (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33(1):1–14

    Article  MATH  MathSciNet  Google Scholar 

  16. Tarantilis C, Kiranoudis C, Vassiliadis V (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148–158

    Article  MATH  MathSciNet  Google Scholar 

  17. Li F, Golden B-L, Wasil E-A (2007) A record to record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2734–2742

    Article  MATH  Google Scholar 

  18. Desrochers M, Verhoog T-W (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comp Oper Res 18:263–274

    Article  MATH  Google Scholar 

  19. Glover F (1989) Tabu search—Part I. ORSA. J Comp 1(3):190–206

    MATH  Google Scholar 

  20. Arntzen H, Hvattum L-M, Lokketangen A (2006) Adaptive memory search for multi demand multidimensional knapsack problems. Comp Oper Res 33:2508–2525

    Article  MATH  MathSciNet  Google Scholar 

  21. Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156–166

    Article  Google Scholar 

  22. Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331–340

    Article  MATH  Google Scholar 

  23. Liu F-H, Shen S-Y (1999) A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur J Oper Res 118:485–504

    Article  MATH  Google Scholar 

  24. Brandão J (2009) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195:716–728

    Article  MATH  Google Scholar 

  25. Golden B, Wasil E, Kelly J, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33–56

    Chapter  Google Scholar 

Download references

Acknowledgments

We would like to thank the anonymous referees for their careful reading and very useful comments on earlier versions of this paper.

Author information

Authors and Affiliations

  1. Quantitatives Methods, GIAD Laboratory, Faculty of Economics and Management, Sfax University, Route de l’aéroport km 4.5, B.P 1088, Sfax, 3018, Tunisie

    Jalel Euchi & Habib Chabchoub

Authors
  1. Jalel Euchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Habib Chabchoub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jalel Euchi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Euchi, J., Chabchoub, H. A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem. Logist. Res. 2, 3–11 (2010). https://doi.org/10.1007/s12159-010-0028-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12159-010-0028-3

Keywords

Search

Navigation