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.
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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
McBride R.D. (1998) Advances in Solving the Multicommodity-Flow Problem. Interfaces 28(2), 32–41
Williams H.P. (1999) Model building in mathematical programming, 4th edition, Wiley
Kopfer H. (1992) Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr. OR Spektrum 14, 137–147
Desrochers M., Soumis F. (2001) A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research 35, 242–254
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
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
Schönberger J. (2004) Operational Freight Carrier Planning-Investigations on Basic Concepts, Optimization Models and Advanced Memetic Algorithms. PhD-Thesis, so far unpublished
Bäck T., Fogel D.B., Michalewicz Z. (2000) Evolutionary Computation 1-Basic Algorithms and Operators. IoP Publishing
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/3-540-27679-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)