Skip to main content
SpringerLink
Log in

Local Search Heuristics for the Design of Freight Carrier Networks

  • Conference paper
Advances in Distribution Logistics

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

  • 314 Accesses

Summary

The design problem of freight carrier networks is an actual problem in Germany due to the changing transport market. Such a network consist of depots, each with a pick-up and delivery area, which are linked by direct relations or via hubs. The design problem involves the decisions on the number and locations of depots and hubs. The operations in a freight carrier network and the design problem are described, a planning model is formulated and a heuristic algorithm based on a Local Search Scheme is presented. Computational tests and a real life application 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.

Similar content being viewed by others

References

  • Aykin, T. (1994): Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem. in: European Journal of Operational Research 79, 501 – 523

    Article  Google Scholar 

  • Aykin, T. (1995): The hub location and routing problem. in: European Journal of Operational Research 83, 200 - 219

    Article  Google Scholar 

  • Balakrishnan, A./Graves, P.C. (1989): A composite algorithm for a concave-cost network flow problem. in: Networks 19, 175 - 202

    Article  Google Scholar 

  • Crainic, T.G./Delorme, L. (1993a): Dual-ascent procedures for multicommodity location- allocation problems with balancing requirements. in: Transportation Science 27/2, 90 – 101

    Article  Google Scholar 

  • Crainic, T.G./Gendreau, M./Soriano, P./Toulouse, M. (1993b): A tabu search procedure for multicommodity location/allocation with balancing requirements. in: Annals of Operations Research 41, 359 – 383

    Article  Google Scholar 

  • Daganzo, C.F. (1991): Logistic System Analysis. (Springer Verlag) Berlin

    Google Scholar 

  • Deutsche Gesellschaft fur Mittelstandsberatung mbH (Ed.) (1995): Transport- und Speditionswesen: Positionen. Perspektiven. Strategien. Neu-Isenburg

    Google Scholar 

  • Domschke, W., Krispin, G. (1997): Location and layout planning — a survey. in: OR Spektrum 19/3, 181–194

    Article  Google Scholar 

  • Dueck, G. (1993): New optimization heuristics: the great deluge algorithm and the record-to-record travel. in: Journal of Computational Physics 104, 86–92

    Article  Google Scholar 

  • Fleischmann, B. (1979): Distributionsplanung. in: Proceedings in Operations Research 8, 293 – 308

    Google Scholar 

  • Fleischmann, B. (1997): Design of freight traffic networks. in: Stähly, P. et al. (Eds): Advances in distribution logistics. (Springer Verlag) Berlin

    Google Scholar 

  • Florian, M. (1986): Nonlinear cost network models in transportation analysis. in: Mathematical Programming Study 26, 167 – 196

    Article  Google Scholar 

  • Khang, D.B./Fujiwara, O. (1991): Approximate solutions of capacitated fixed-charge minimum cost network flow problems. in: Networks 21, 689 – 704

    Article  Google Scholar 

  • Klincewicz, J.G. (1991): Heuristics for the p-hub location problem. in: European Journal of Operational Research 53, 25 – 37

    Article  Google Scholar 

  • Larsson, T./Migdalas, A./Ronnqvist, M. (1994): A lagrangean heuristic for the capacitated concave minimum cost network flow problem. in: European Journal of Operational Research 78, 116 – 129

    Article  Google Scholar 

  • Leung, J.M.Y./Magnanti, T.L./Singhal, V. (1990): Routing in point-to-point delivery systems: formulations and solution heuristics. in: Transportation Science 24/4, 245 – 260

    Article  Google Scholar 

  • Skorin-Kapov, D./Skorin-Kapov, J. (1994): On tabu search for the location of interacting hub facilities. in: European Journal of Operational Research 73, 502 – 509

    Article  Google Scholar 

  • Stumpf, P. (1997): Vehicle routing and scheduling for trunk haulage. in: Stähly, P. et al. (Eds): Advances in distribution logistics, (Springer Verlag) Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Produktion und Logistik, Universtität Augsburg, Universitätsstraße 16, D-86135, Augsburg, Germany

    Helmut Wlcek

Authors
  1. Helmut Wlcek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Production and Logistics, University of Augsburg, Universitätsstraße 16, D-86135, Augsburg, Germany

    Bernhard Fleischmann

  2. Rotterdam School of Management, Erasmus University Rotterdam, P.O. Box 1738, NL-3000 DR, Rotterdam, The Netherlands

    Jo A. E. E. van Nunen

  3. Department of Quantitative Methods, University of Brescia, C. da S. Chiara 48b, I-25122, Brescia, Italy

    M. Grazia Speranza

  4. Institute for Operations Research, University of St. Gallen, Bodanstraße 6, CH-900, St. Gallen, Switzerland

    Paul Stähly

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wlcek, H. (1998). Local Search Heuristics for the Design of Freight Carrier Networks. In: Fleischmann, B., van Nunen, J.A.E.E., Speranza, M.G., Stähly, P. (eds) Advances in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol 460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46865-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46865-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64288-6

  • Online ISBN: 978-3-642-46865-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation