Abstract
In this paper we address a rich variant of the vehicle routing problem which occurs in real-life applications. Among other aspects we take into consideration time windows, simultaneous delivery and pick-up at customer locations, multiple use of vehicles, and timely allocation of vehicles to loading bays at the depot. In order to solve practical instances of the resulting real-life rich vehicle routing problem, efficient methods are required. For this reason, we present a sampling procedure, which is a multi-start algorithm that executes in each call a substantial extension of the well-known savings algorithm. Using a set of suitable benchmark instances, we assess the performance of the proposed sampling procedure.
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
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12: 568–581
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Science 6:80–91
Drexl A (1991) Scheduling of project networks by job assignment, Management Science 37:1590–1602
Toth P, Vigo D (2002) The vehicle routing problem. Siam, Philadelphia
Rieck J, Zimmermann J (2006) Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen. In: Haasis H-D, Kopfer H, Schönberger J (eds) Operations Research Proceedings 2005. Springer, Berlin et al.
Solomon M (1987) Algorithm for the vehicle routing and scheduling problems with time window constraints, Operations Research 35:254–265
http://web.cba.neu.edu/~msolomon/problems.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rieck, J., Zimmermann, J. (2007). A Sampling Procedure for Real-Life Rich Vehicle Routing Problems. 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_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)