Skip to main content
SpringerLink
Log in

Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application

  • Conference paper
Operations Research Proceedings 2005

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

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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.

5 References

  • Brandão J, (2004). A tabu search heuristic algorithm for open vehicle routing problem. European Journal of Operational Research 157: 552–564.

    Article  MATH  MathSciNet  Google Scholar 

  • Clarke G, Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12: 568–581.

    Article  Google Scholar 

  • 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.

    Article  MATH  Google Scholar 

  • Sariklis D, Powell S (2000). A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society 51: 564–573.

    Article  MATH  Google Scholar 

  • Schrage L (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11: 229–232.

    Google Scholar 

  • 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.

    Article  MATH  Google Scholar 

  • 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.

    Google Scholar 

  • Tarantilis CD, Kiranoudis CT (2002). Distribution of fresh meat. Journal of Food Engineering 51: 85–91.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Administrative Sciences and Economics, Rumelifeneri Yolu, Sarıyer, Koç University, 34450, İstanbul, Turkey

    Zeynep Özyurt & Deniz Aksen

  2. Industrial Engineering Dept., Bebek, Boğaziçi University, 34342, İstanbul, Turkey

    Necati Aras

Authors
  1. Zeynep Özyurt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deniz Aksen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Necati Aras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Shipping Economics and Logistics Dept. Logistics Systems, University of Bremen, Universitätsallee GW1 Block A, 28359, Bremen, Germany

    Hans-Dietrich Haasis

  2. Faculty of Business Studies and Economics Chair of Logistics, University of Bremen, PO Box 33 04 40, 28334, Bremen, Germany

    Herbert Kopfer  & Jörn Schönberger  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation