Advertisement

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

  • Julia Rieck
  • Jürgen ZimmermannEmail author
Chapter
Part of the Lecture Notes in Economics and Mathematical Systems book series (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.

Keywords

Freight-handling Less-than-truckload carriers Vehicle routing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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)CrossRefGoogle Scholar
  5. 5.
    Bräysy, O., Gendreau, M.: Vehicle routing with time windows, part II: metaheuristics. Transportation Sci. 39, 119–139 (2005)CrossRefGoogle Scholar
  6. 6.
    Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20, 309–318 (1969)CrossRefGoogle Scholar
  7. 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. 8.
    Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)CrossRefGoogle Scholar
  9. 9.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1959)CrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 11.
    Desrosiers, J., Soumis, F., Desrochers M.: Routing with time windows by column generation. Networks 14, 545–565 (1984)CrossRefGoogle Scholar
  12. 12.
    Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23, 79–96 (2001)CrossRefGoogle Scholar
  13. 13.
    Drexl, A.: Scheduling of project networks by job assignment. Manage. Sci. 37, 1590–1602 (1991)CrossRefGoogle Scholar
  14. 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. 15.
    Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22, 340–349 (1974)CrossRefGoogle Scholar
  16. 16.
    Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49–66 (1984)CrossRefGoogle Scholar
  17. 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. 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)CrossRefGoogle Scholar
  19. 19.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)Google Scholar
  20. 20.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498–512 (1973)CrossRefGoogle Scholar
  21. 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. 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)CrossRefGoogle Scholar
  23. 23.
    Min, H.: The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Res. A 23A, 377–386 (1989)CrossRefGoogle Scholar
  24. 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)CrossRefGoogle Scholar
  25. 25.
    Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254–265 (1987)CrossRefGoogle Scholar
  26. 26.
    Taillard, E.D.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)CrossRefGoogle Scholar
  27. 27.
    Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. Rairo 33, 1–14 (1999)CrossRefGoogle Scholar
  28. 28.
    Taillard, E.D., Laporte, G., Gendreau, M.: Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47, 1065–1070 (1996)CrossRefGoogle Scholar
  29. 29.
    Toth, P., Vigo, D.: The vehicle routing problem. Siam, Philadelphia (2002)Google Scholar
  30. 30.
    Vehicle Routing Data Sets. Retrieved January 2008, from http://branchandcut.org/VRP/data/
  31. 31.
    Vehicle Routeing Instances. Retrieved January 2008, from http://mistic.heig-vd.ch/taillard/problemes.dir/vrp.dir/vrp.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Operations Research Group, Institute of Management and EconomicsClausthal University of TechnologyClausthal-ZellerfeldGermany

Personalised recommendations