Skip to main content

Integrated Operational Transportation Planning in Theory and Practice

  • Conference paper

Part of the Operations Research Proceedings book series (ORP,volume 2006)

Abstract

Outsourcing (subcontraction) makes use of external entities as an alternative to the usage of own resources (self-fulfillment). The arising ‘make-or-buy’ decision combining the two clusters of self-fulfillment and subcontraction evolves in a complex reference analysis among items involved [13].

Keywords

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.

This is a preview of subscription content, log in via an institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chu C (2005) A heuristic algorithm for the truckload and less than truckload problem. European Journal of Operations Research 165: 657–667

    CrossRef  Google Scholar 

  2. Dumas Y, Desrosiers J, Soumis F (1997) The pickup and delivery problem with time windows. European Journal of Operations Research 54: 7–22

    CrossRef  Google Scholar 

  3. Greb T (1998) Interaktive Tourenplanung mit Tabu Search. PhD Thesis, University of Bremen, Bremen

    Google Scholar 

  4. Jurczyk A, Kopfer H, Krajewska M (2006) Speditionelle Auftagsdisposition eines mittelständischen Transportunternehmens. Internationales Verkehrswesen 6: 275–279

    Google Scholar 

  5. Kopfer H (1990) Der Entwurf und die Realisierung eines A*-Verfahrens zur Lösung des Frachtoptimierungsproblems. OR Spectrum 12: 207–218

    Google Scholar 

  6. Kopfer H (1992) Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr. OR Spectrum 14: 137–147

    Google Scholar 

  7. Lau H, Liang Z (2001) Pickup and delivery problem with time windows: algorithms and test generation. Proceedings IEEE Conference on Tools with Artificial Intelligence: 222–340

    Google Scholar 

  8. Pankratz G (2002) Speditionelle Transportdisposition. PhD Thesis, University of Hagen, Wiesbaden

    Google Scholar 

  9. Savelsbergh M, Sol M (1998) DRIVE: Dynamic routing of independent vehicles. Operations Research 46: 474–490

    CrossRef  Google Scholar 

  10. Schönberger J, Kopfer H (2004) Freight flow consolidation in presence of time windows. Operations Research Proceedings 2004: 184–192

    Google Scholar 

  11. Schönberger H (2005) Operational Freight Carrier Planning. Springer, Berlin Heidelberg New York

    Google Scholar 

  12. Stumpf P (1998) Tourenplanung im speditionellen Güterfremdverkehr. Schriftleihe der Gesellschaft für Verkehrsbetriebswirtschaft und Logistik, Nürnberg

    Google Scholar 

  13. Wellenhofer-Klein M (1999) Zulieferverträge im Privat-und Wirtschaftsrecht. Beck Verlag, München

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kopfer, H., Krajewska, M.A. (2007). Integrated Operational Transportation Planning in Theory and Practice. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_61

Download citation

Publish with us

Policies and ethics