Skip to main content

Freight Flow Consolidation in Presence of Time Windows

  • Conference paper
Operations Research Proceedings 2004

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

Abstract

This contribution addresses the consideration of time windows in the optimization of multi-commodity network flows. For each node, one interval is specified in which the visitation is allowed. Applications in freight flow consolidation let this problem become interesting. An optimization model is proposed and a construction heuristic is presented. For improving the generated solutions, a genetic algorithm framework including several hill climbing procedures for local optimization, is configured.

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

Access this chapter

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.

References

  1. McBride R.D. (1998) Advances in Solving the Multicommodity-Flow Problem. Interfaces 28(2), 32–41

    Article  Google Scholar 

  2. Williams H.P. (1999) Model building in mathematical programming, 4th edition, Wiley

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Desrochers M., Soumis F. (2001) A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research 35, 242–254

    Article  MathSciNet  Google Scholar 

  5. Nanry W.B., Barnes J.W. (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B 34, 107–121

    Article  Google Scholar 

  6. Schönberger J., Kopfer H., Mattfeld, D.C. (2002) A Combined Approach to Solve the Pickup And Delivery Selection Problem in Leopold-Wildburger U., Rendl F., Wäscher G. (eds.) Operations Research Proceedings 2002

    Google Scholar 

  7. Schönberger J. (2004) Operational Freight Carrier Planning-Investigations on Basic Concepts, Optimization Models and Advanced Memetic Algorithms. PhD-Thesis, so far unpublished

    Google Scholar 

  8. Bäck T., Fogel D.B., Michalewicz Z. (2000) Evolutionary Computation 1-Basic Algorithms and Operators. IoP Publishing

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schönberger, J., Kopfer, H. (2005). Freight Flow Consolidation in Presence of Time Windows. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_23

Download citation

Publish with us

Policies and ethics