Skip to main content

An Efficient Timing Algorithm for Drivers with Rest Periods

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2024)

Abstract

We consider a timing problem arising from a vehicle routing context: it consists of optimally inserting rest periods of given duration into drivers’ schedules, when the sequence of customers to visit is given, time windows are associated with customers and an upper limit is imposed on the driving time with no rest periods. We illustrate some properties that allow reformulating the problem in simpler terms, and provide the basis to design a very efficient exact optimization algorithm whose worst-case time complexity is \(O(n \log {n})\), where n is the number of customers to be visited.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Novello, G.: Mathematical optimization algorithms for the insertion of breaks in truck driver duties. Master thesis, University of Milan (2022)

    Google Scholar 

  2. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Timing problems and algorithms: time decisions for sequences of activities. Networks 65(2), 102–128 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors acknowledge their fruitful collaboration with Giulia Novello, who developed a dynamic programming algorithm for the TPRP, and WorkWaveFleet that provided the problem description and several real or realistic instances.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giovanni Righini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Righini, G., Trubian, M. (2024). An Efficient Timing Algorithm for Drivers with Rest Periods. In: Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594. Springer, Cham. https://doi.org/10.1007/978-3-031-60924-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-60924-4_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-60923-7

  • Online ISBN: 978-3-031-60924-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics