Skip to main content
SpringerLink
Log in

A Metaheuristic for a Two Echelon Location-Routing Problem

  • Conference paper
Book cover Experimental Algorithms (SEA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6049))

Included in the following conference series:

Abstract

In this paper we consider the design problem of a two-echelon freight distribution system. The aim is to define the structure of a system optimizing the location and the number of two different kinds of facilities, the size of two different vehicle fleets and the related routes on each echelon. The problem has been modeled as a two-echelon location-routing problem (2E-LRP). A tabu-search heuristic efficiently combining the composing subproblems is presented. Results on small, medium and large size instances are reported.

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. Ambrosino, D., Scutellá, M.G.: Distribution network design: New problems and related models. Eur. Jour. of Oper. Res. 165, 610–624 (2005)

    Article  MATH  Google Scholar 

  2. Albareda, S.M., Diaz, J., Fernández, E.: A compact model and tight bounds for a combined location-routing problem. Comp. and Oper. Res. 32, 407–428 (2005)

    Article  MATH  Google Scholar 

  3. Barreto, S., Ferreira, C., Paixao, J., Santon, B.S.: Using clustering analysis in a capacitated location-routing problem. Eur. Jour. of Oper. Res. 179(3), 968–977 (2007)

    Article  MATH  Google Scholar 

  4. Chien, T.W.: Heuristic Procedures for Practical-Sized Uncapacitated Location-Capacitated Routing Problems. Decision Sciences 24(5), 993–1021 (1993)

    Article  MathSciNet  Google Scholar 

  5. Crainic, T.G., Ricciardi, N., Storchi, G.: Advanced freight transportation systems for congested urban areas. Transportation Research Part C: Emerging Technologies 12(2), 119–137 (2004)

    Article  Google Scholar 

  6. Hansen, P.H., Hegedahl, B., Hjortkjaer, S., Obel, B.: A heuristic solution to the warehouse location-routing problem. Eur. Jour. of Oper. Res. 76, 111–127 (1994)

    Article  MATH  Google Scholar 

  7. Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level location routing problem. Eur. Jour. of Oper. Res. 5, 378–387 (1980)

    Article  MATH  Google Scholar 

  8. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–104. Plenum Press, New York (1972)

    Google Scholar 

  9. Laporte, G.: Location-routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: Methods and studies. North-Holland, Amsterdam (1988)

    Google Scholar 

  10. Laporte, G., Nobert, Y.: An exact algorithm for minimizing routing and operating costs in depot location. European Journal of Oper. Res. 6, 224–226 (1981)

    Article  MATH  Google Scholar 

  11. Laporte, G., Nobert, Y., Arpin, D.: An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research 6, 293–310 (1986)

    Article  Google Scholar 

  12. Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22, 161–172 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Madsen, O.B.G.: Methods for solving combined two level location-routing problems of realistic dimensions. European Journal of Oper. Res. 12(3), 295–301 (1983)

    Article  Google Scholar 

  14. Melechovský, J., Prins, C., Calvo, R.W.: A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics 11, 375–391 (2005)

    Article  MATH  Google Scholar 

  15. Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: A synthesis and future research directions. Eur. Jour. of Oper. Res. 108, 1–15 (1998)

    Article  MATH  Google Scholar 

  16. Nagy, G., Salhi, S.: Nested Heuristic Methods for the Location-Routeing Problem. The Journal of the Operational Research Society 47(9), 1166–1174 (1996)

    MATH  Google Scholar 

  17. Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research 177, 649–672 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Or, I., Pierskalla, W.P.: A transportation location-allocation model for regional blood banking. AIIE Transactions 11, 86–95 (1979)

    Google Scholar 

  19. Perl, J., Daskin, M.S.: A warehouse location-routing problem. Transportation Research Part B 19(5), 381–396 (1985)

    Article  Google Scholar 

  20. Srivastava, R.: Alternate solution procedures for the location-routing problem. Omega International Journal of Management Science 21(4), 497–506 (1993)

    Article  Google Scholar 

  21. Sterle, C.: Location-routing models and methods for Freight Distribution and Infomobility in City Logistics. PhD thesis, University of Naples, Italy (2009)

    Google Scholar 

  22. Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116, 87–99 (1999)

    Article  MATH  Google Scholar 

  23. Wu, T.H., Chinyao, L., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research 29, 1393–1415 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Engineering, Universitá del Sannio,  

    Maurizio Boccia

  2. Dept. Management et Technologie, Université du Québec á Montréal, and Centre for Research on Transportation, Montreal

    Teodor G. Crainic

  3. Dept. of Computer Science and Systems, Universitá di Napoli “Federico II”,  

    Antonio Sforza & Claudio Sterle

Authors
  1. Maurizio Boccia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teodor G. Crainic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Sforza
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Claudio Sterle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Napoli, Italy

    Paola Festa

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boccia, M., Crainic, T.G., Sforza, A., Sterle, C. (2010). A Metaheuristic for a Two Echelon Location-Routing Problem. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13193-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13192-9

  • Online ISBN: 978-3-642-13193-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation