Abstract
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the same route back. In this study, we present a modified Clarke-Wright parallel savings algorithm, a nearest insertion algorithm and a tabu search heuristic for the open vehicle routing problem with time deadlines. Some random test problems and a real-life school bus routing problem are solved by these heuristics, and results are compared.
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
5 References
Brandão J, (2004). A tabu search heuristic algorithm for open vehicle routing problem. European Journal of Operational Research 157: 552–564.
Clarke G, Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12: 568–581.
Fu Z, Eglese R, Li LYO (2005). A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society 56: 267–274.
Sariklis D, Powell S (2000). A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society 51: 564–573.
Schrage L (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11: 229–232.
Tarantilis CD, Diakoulaki D, Kiranoudis CT (2004). Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research 152: 437–453.
Tarantilis CD, Ioannou G, Kiranoudis CT, Prasdacos GP (2004). Solving the open vehicle routing problem via single parameter meta-heuristic algorithm. Journal of the Operational Research Society: 1–9.
Tarantilis CD, Kiranoudis CT (2002). Distribution of fresh meat. Journal of Food Engineering 51: 85–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Özyurt, Z., Aksen, D., Aras, N. (2006). Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)