Skip to main content
SpringerLink
Log in

A Hybrid Algorithm for Vehicle Routing of Less-Than-Truckload Carriers

  • Chapter
  • First Online:
Metaheuristics in the Service Industry

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 624))

Abstract

In this paper we address a variant of the vehicle routing problem faced by less-than-truckload carriers in Europe. As a consequence of globalization and increasing customer expectations, medium-sized less-than truckload carriers operate together in cooperations. Each cooperative member faces a multitude of requirements when constructing a low-cost, feasible set of routes. Among other aspects heterogeneous vehicles, time windows, simultaneous delivery and pick-up at customer locations, and multiple use of vehicles have to be considered. After the determination of an adequate set of routes, the vehicles must be assigned to loading bays at the depot at which the loading and unloading activities can occur.We present a vehicle routing model which integrates the real-life vehicle routing problem and the assignment problem of vehicles to loading bays at the depot. The proposed solution heuristic combines a multi-start and a local search procedure. Using a set of suitable benchmark instances, we assess the performance of the proposed method.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angelelli, E., Mansini, R.: The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose, A., Grazia Speranza, M., Van Wassenhove, L.N. (eds.) Quantitative Approaches to Distribution Logistics and Supply Chain Management, pp. 249–267. Springer, Berlin (2002)

    Google Scholar 

  2. Augerat, P.: Approche polyédrale du Problème de Tournées de Véhicles. Ph.D. thesis, Université Grenoble, France (1995)

    Google Scholar 

  3. Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L.: Handbooks in Operations Research and Management Science, Vol. 8: Network Routing. Elsevier, Amsterdam (1995)

    Google Scholar 

  4. Bräysy, O., Gendreau, M.: Vehicle routing with time windows, part I: route construction and local search algorithms. Transportation Sci. 39, 104–118 (2005)

    Article  Google Scholar 

  5. Bräysy, O., Gendreau, M.: Vehicle routing with time windows, part II: metaheuristics. Transportation Sci. 39, 119–139 (2005)

    Article  Google Scholar 

  6. Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20, 309–318 (1969)

    Article  Google Scholar 

  7. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Derigs, U., Döhmer, T.: Router: a fast and flexible local search algorithm for a class of rich vehicle routing problems. In: Fleuren, H., Den Hertog, D., Kort, P. (eds.) Operations Research Proceedings 2004, pp. 144–149. Springer, Berlin (2005)

    Chapter  Google Scholar 

  11. Desrosiers, J., Soumis, F., Desrochers M.: Routing with time windows by column generation. Networks 14, 545–565 (1984)

    Article  Google Scholar 

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

    Article  Google Scholar 

  13. Drexl, A.: Scheduling of project networks by job assignment. Manage. Sci. 37, 1590–1602 (1991)

    Article  Google Scholar 

  14. Garey, M.R., Johnson, D.S.: Computers and Intractablility: A Guide to the Theory of NP Completeness. Freeman, New York (1979)

    Google Scholar 

  15. Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22, 340–349 (1974)

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Hajri-Gabouj, S., Darmoul, S.: A hybrid evolutionary approach for a vehicle routing problem with double time windows for the depot and multiple use of vehicles. Stud. Inform. Control 12, 253–268 (2003)

    Google Scholar 

  18. Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.M.: Vehicle routing problem with time windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 67–98. Springer, New York (2005)

    Chapter  Google Scholar 

  19. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)

    Google Scholar 

  20. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498–512 (1973)

    Article  Google Scholar 

  21. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Sys. 5, 299–326 (1991)

    Google Scholar 

  22. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett. 11, 219–224 (1992)

    Article  Google Scholar 

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

    Article  Google Scholar 

  24. Rieck, J., Zimmermann, J.: A sampling procedure for real-life rich vehicle routing problems. In: Waldmann, K.-H., Stocker, U.M. (eds.) Operations Research Proceedings 2006, pp. 355–360. Springer, Berlin (2007)

    Chapter  Google Scholar 

  25. Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  Google Scholar 

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

    Article  Google Scholar 

  27. Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. Rairo 33, 1–14 (1999)

    Article  Google Scholar 

  28. Taillard, E.D., Laporte, G., Gendreau, M.: Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47, 1065–1070 (1996)

    Article  Google Scholar 

  29. Toth, P., Vigo, D.: The vehicle routing problem. Siam, Philadelphia (2002)

    Google Scholar 

  30. Vehicle Routing Data Sets. Retrieved January 2008, from http://branchandcut.org/VRP/data/

  31. Vehicle Routeing Instances. Retrieved January 2008, from http://mistic.heig-vd.ch/taillard/problemes.dir/vrp.dir/vrp.html

Download references

Author information

Authors and Affiliations

  1. Operations Research Group, Institute of Management and Economics, Clausthal University of Technology, Julius-Albert-Str. 2, 38678, Clausthal-Zellerfeld, Germany

    Julia Rieck & Jürgen Zimmermann

Authors
  1. Julia Rieck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jürgen Zimmermann .

Editor information

Editors and Affiliations

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 2009 Springer-Verlag Berlin Heidelberg

    About this chapter

    Cite this chapter

    Rieck, J., Zimmermann, J. (2009). A Hybrid Algorithm for Vehicle Routing of Less-Than-Truckload Carriers. In: Sörensen, K., Sevaux, M., Habenicht, W., Geiger, M. (eds) Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00939-6_9

    Download citation

    Publish with us

    Policies and ethics

    Search

    Navigation