Skip to main content
Erschienen in: Logistics Research 1/2010

01.06.2010 | Original Paper

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

verfasst von: Jalel Euchi, Habib Chabchoub

Erschienen in: Logistics Research | Ausgabe 1/2010

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Eilon S, Watson-Grandy C, Christofides N (1971) Distribution management: mathematical modeling and practical analysis. Hafner, New York Eilon S, Watson-Grandy C, Christofides N (1971) Distribution management: mathematical modeling and practical analysis. Hafner, New York
3.
Zurück zum Zitat 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–211MathSciNet 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–211MathSciNet
4.
Zurück zum Zitat Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358MATHCrossRef Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358MATHCrossRef
5.
Zurück zum Zitat Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):247–291CrossRef Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):247–291CrossRef
6.
Zurück zum Zitat 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):143CrossRef 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):143CrossRef
7.
Zurück zum Zitat Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487–512MATHMathSciNetCrossRef Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487–512MATHMathSciNetCrossRef
8.
Zurück zum Zitat 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–66MATHCrossRef 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–66MATHCrossRef
9.
Zurück zum Zitat 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–1173MATHCrossRef 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–1173MATHCrossRef
10.
Zurück zum Zitat Choi E, Tcha D-W (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2080–2095MATHCrossRef Choi E, Tcha D-W (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2080–2095MATHCrossRef
11.
Zurück zum Zitat Salhi S, Sari M, Sadi D, Touati NAC (1992) Adaptation of some vehicle fleet mix heuristics. OMEGA 20:653–660CrossRef Salhi S, Sari M, Sadi D, Touati NAC (1992) Adaptation of some vehicle fleet mix heuristics. OMEGA 20:653–660CrossRef
12.
Zurück zum Zitat 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–153CrossRef 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–153CrossRef
13.
Zurück zum Zitat Taillard E-D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661–673MATHCrossRef Taillard E-D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661–673MATHCrossRef
14.
Zurück zum Zitat Taillard E-D, Rochat Y (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147–167MATHCrossRef Taillard E-D, Rochat Y (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147–167MATHCrossRef
16.
Zurück zum Zitat 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–158MATHMathSciNetCrossRef 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–158MATHMathSciNetCrossRef
17.
Zurück zum Zitat 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–2742MATHCrossRef 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–2742MATHCrossRef
18.
Zurück zum Zitat Desrochers M, Verhoog T-W (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comp Oper Res 18:263–274MATHCrossRef Desrochers M, Verhoog T-W (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comp Oper Res 18:263–274MATHCrossRef
19.
Zurück zum Zitat Glover F (1989) Tabu search—Part I. ORSA. J Comp 1(3):190–206MATH Glover F (1989) Tabu search—Part I. ORSA. J Comp 1(3):190–206MATH
20.
Zurück zum Zitat Arntzen H, Hvattum L-M, Lokketangen A (2006) Adaptive memory search for multi demand multidimensional knapsack problems. Comp Oper Res 33:2508–2525MATHMathSciNetCrossRef Arntzen H, Hvattum L-M, Lokketangen A (2006) Adaptive memory search for multi demand multidimensional knapsack problems. Comp Oper Res 33:2508–2525MATHMathSciNetCrossRef
21.
Zurück zum Zitat Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156–166CrossRef Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156–166CrossRef
22.
Zurück zum Zitat 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–340MATHCrossRef 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–340MATHCrossRef
23.
Zurück zum Zitat 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–504MATHCrossRef 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–504MATHCrossRef
24.
Zurück zum Zitat Brandão J (2009) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195:716–728MATHCrossRef Brandão J (2009) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195:716–728MATHCrossRef
25.
Zurück zum Zitat 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–56CrossRef 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–56CrossRef
Metadaten
Titel
A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem
verfasst von
Jalel Euchi
Habib Chabchoub
Publikationsdatum
01.06.2010
Verlag
Springer Berlin Heidelberg
Erschienen in
Logistics Research / Ausgabe 1/2010
Print ISSN: 1865-035X
Elektronische ISSN: 1865-0368
DOI
https://doi.org/10.1007/s12159-010-0028-3

Weitere Artikel der Ausgabe 1/2010

Logistics Research 1/2010 Zur Ausgabe