The Single-Stage Location-Routing Problem with Time Windows

  • Halil Ibrahim Gündüz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6971)


The well-known capacitated facility location problem (CFLP) and the vehicle routing problem with time windows (VRPTW) have been studied intensively over the last decades. In most distribution systems, depot location and routing decisions are implemented independently. Low-quality solutions are obtained if a sequential method, e.g., locate depots first and plan routes second, is used. In location-routing problems (LRP), location and routing are solved simultaneously. Here, our goal is to combine the CFLP and the VRPTW into a single-stage LRP with time windows (SSLRPTW), which covers more realistic aspects, especially time aspects, of many real problems. In order to efficiently solve the SSLRPTW for large-scale instances, a tabu search heuristic is proposed. This method outperforms the used sequential method.


Time Window Tabu Search Monetary Unit Open Depot Quantity Unit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
    Albareda-Sambola, M., Diaz, J.A., Fernandez, E.: A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research 32(3), 407–428 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Balinski, M.L.: Integer programming methods, uses, computation. Management Science 12, 253–313 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bräysy, O., Gendreau, M.: Vehicle routing with time windows, Part I: Route construction and local search algorithms. Transportation Science 39(1), 119–139 (2005)CrossRefGoogle Scholar
  5. 5.
    Bruns, A., Klose, A., Stähly, P.: Restructuring of Swiss parcel delivery services. OR Spectrum 22, 285–302 (2000)CrossRefzbMATHGoogle Scholar
  6. 6.
    Chan, Y., Carter, W.B., Burns, M.D.: A multi-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers & Operations Research 28, 803–826 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)CrossRefGoogle Scholar
  8. 8.
    Gunnarsson, H., Rönnqvist, M., Carlsson, D.: A combined terminal location and ship routing problem. Journal of the Operational Research Society 57(8), 928–938 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Irnich, I.: Resource extension functions: properties, inversion, and generalization to segments. OR Spectrum 30, 113–148 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research 5, 378–387 (1980)CrossRefzbMATHGoogle Scholar
  11. 11.
    Kuehn, M.J., Hamburger, A.A.: A heuristic program for locating warehouses. Management Science 9, 643–666 (1963)CrossRefGoogle Scholar
  12. 12.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245–2269 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Lischak, C.: Standortplanung für einen privaten Paketdienstleister. Ph.D. thesis, RWTH Aachen University (2001)Google Scholar
  14. 14.
    Murty, K.G., Djang, P.A.: The U.S. army national guards mobile training simulators location. Operations Research 47(2), 175–183 (1999)CrossRefzbMATHGoogle Scholar
  15. 15.
    Nagy, G., Salhi, S.: Nested heuristic methods for the location-routeing problem. Journal of the Operational Research Society 47(9), 1166–1174 (1996)CrossRefzbMATHGoogle Scholar
  16. 16.
    Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research 177, 649–672 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Nambiar, J.M., Gelders, L.F., Van Wassenhove, L.N.: Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study. European Journal of Operational Research 38(1), 14–29 (1989)CrossRefGoogle Scholar
  18. 18.
    Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University (1976)Google Scholar
  19. 19.
    Perl, J., Daskin, M.S.: A unified warehouse location-routing methodology. Journal of Business Logistics 5(1), 92–111 (1984)Google Scholar
  20. 20.
    Perl, J., Daskin, M.S.: A unified warehouse location-routing. Transport Research Part B 19B(5), 381–396 (1985)CrossRefGoogle Scholar
  21. 21.
    Prodhon, C.: A hybrid evolutionary algorithm for periodic location-routing problem. European Journal of Operational Research 210, 204–212 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Salhi, S., Fraser, M.: An integrated heuristic approach for the combined location vehicle fleet mix problem. Studies in Locational Analysis 8, 3–21 (1996)zbMATHGoogle Scholar
  23. 23.
    Salhi, S., Rand, G.K.: The effect of ignoring routes when location depots. European Journal of Operational Research 39, 150–156 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Toth, P., Vigo, D. (eds.): The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2002)Google Scholar
  25. 25.
    Tuzun, D., Burke, L.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116, 87–99 (1999)CrossRefzbMATHGoogle Scholar
  26. 26.
    Wasner, M., Zäpfner, G.: An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. Operations Research Letters 20, 403–419 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Halil Ibrahim Gündüz
    • 1
  1. 1.Deutsche Post Lehrstuhl für Optimierung von Distributionsnetzwerken RWTHAachenGermany

Personalised recommendations