Advertisement

Local Search Heuristics for the Design of Freight Carrier Networks

  • Helmut Wlcek
Conference paper
  • 224 Downloads
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 460)

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.

Keywords

Base Quantity Depot Link Neighbourhood Definition Convex Cost Function Minimum Cost Network Flow Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aykin, T. (1994): Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem. in: European Journal of Operational Research 79, 501 – 523CrossRefGoogle Scholar
  2. Aykin, T. (1995): The hub location and routing problem. in: European Journal of Operational Research 83, 200 - 219CrossRefGoogle Scholar
  3. Balakrishnan, A./Graves, P.C. (1989): A composite algorithm for a concave-cost network flow problem. in: Networks 19, 175 - 202CrossRefGoogle Scholar
  4. Crainic, T.G./Delorme, L. (1993a): Dual-ascent procedures for multicommodity location- allocation problems with balancing requirements. in: Transportation Science 27/2, 90 – 101CrossRefGoogle Scholar
  5. 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 – 383CrossRefGoogle Scholar
  6. Daganzo, C.F. (1991): Logistic System Analysis. (Springer Verlag) BerlinGoogle Scholar
  7. Deutsche Gesellschaft fur Mittelstandsberatung mbH (Ed.) (1995): Transport- und Speditionswesen: Positionen. Perspektiven. Strategien. Neu-IsenburgGoogle Scholar
  8. Domschke, W., Krispin, G. (1997): Location and layout planning — a survey. in: OR Spektrum 19/3, 181–194CrossRefGoogle Scholar
  9. Dueck, G. (1993): New optimization heuristics: the great deluge algorithm and the record-to-record travel. in: Journal of Computational Physics 104, 86–92CrossRefGoogle Scholar
  10. Fleischmann, B. (1979): Distributionsplanung. in: Proceedings in Operations Research 8, 293 – 308Google Scholar
  11. Fleischmann, B. (1997): Design of freight traffic networks. in: Stähly, P. et al. (Eds): Advances in distribution logistics. (Springer Verlag) BerlinGoogle Scholar
  12. Florian, M. (1986): Nonlinear cost network models in transportation analysis. in: Mathematical Programming Study 26, 167 – 196CrossRefGoogle Scholar
  13. Khang, D.B./Fujiwara, O. (1991): Approximate solutions of capacitated fixed-charge minimum cost network flow problems. in: Networks 21, 689 – 704CrossRefGoogle Scholar
  14. Klincewicz, J.G. (1991): Heuristics for the p-hub location problem. in: European Journal of Operational Research 53, 25 – 37CrossRefGoogle Scholar
  15. 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 – 129CrossRefGoogle Scholar
  16. 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 – 260CrossRefGoogle Scholar
  17. 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 – 509CrossRefGoogle Scholar
  18. Stumpf, P. (1997): Vehicle routing and scheduling for trunk haulage. in: Stähly, P. et al. (Eds): Advances in distribution logistics, (Springer Verlag) BerlinGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Helmut Wlcek
    • 1
  1. 1.Lehrstuhl für Produktion und LogistikUniverstität AugsburgAugsburgGermany

Personalised recommendations