Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows | SpringerLink
Skip to main content
Springer Nature Link
Log in

Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows

  • Conference paper
  • First Online:
Operations Research Proceedings 2018

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

Abstract

The capacitated Vehicle Routing Problem with structured Time Windows (cVRPsTW) is concerned with finding optimal tours for vehicles with given capacity constraints to deliver goods to customers within assigned time windows. In our problem variant these time windows have a special structure, namely they are non-overlapping and each time window holds several customers. This is a reasonable assumption for Attended Home Delivery services. Sweep algorithms are known as simple, yet effective heuristics for the classical capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm that are not only able to deal with time windows, but also exploit the additional structure of the time windows in a cVRPsTW. Afterwards we suggest local improvement heuristics to decrease our objective function even further. A carefully constructed benchmark set that resembles real-world data is used to prove the efficacy of our algorithms in a computational study.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1), 1–6 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)

    Article  Google Scholar 

  3. Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340–349 (1974)

    Article  MATH  Google Scholar 

  4. Hungerländer, P., Truden, C.: Efficient and easy-to-implement mixed-integer linear programs for the traveling salesperson problem with time windows. Transp. Res. Procedia 30, 157–166 (2018)

    Article  Google Scholar 

  5. Pan, S., Giannikas, V., Han, Y., Grover-Silva, E., Qiao, B.: Using customer-related data to enhance e-grocery home delivery. Ind. Manag. Data Syst. 117(9), 1917–1933 (2017)

    Article  Google Scholar 

  6. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Tarjan, R.E.: Finding optimum branchings. Networks 7(1), 25–35 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Christoph Hertrich is supported by the Karl Popper Kolleg “Modeling-Simulation-Optimization” funded by the Alpen-Adria-Universität Klagenfurt and the Carinthian Economic Promotion Fund (KWF).

Author information

Authors and Affiliations

  1. Department of Mathematics, Technische Universität Kaiserslautern, Kaiserslautern, Germany

    Christoph Hertrich

  2. Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria

    Philipp Hungerländer & Christian Truden

Authors
  1. Christoph Hertrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philipp Hungerländer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Truden
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christoph Hertrich .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Université Libre de Bruxelles, Brussels, Belgium

    Bernard Fortz

  2. Department of Computer Science, Université Libre de Bruxelles, Brussels, Belgium

    Martine Labbé

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hertrich, C., Hungerländer, P., Truden, C. (2019). Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_17

Download citation

Publish with us

Policies and ethics