Skip to main content

Optimizing Time Slot Allocation in Single Operator Home Delivery Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

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

  • 1988 Accesses

Abstract

Motivated by applications in last-mile home delivery, we tackle the problem of optimizing service time to customers by service providers in an online-realtime scenario. We focus on the particular case where a single operator performs all deliveries. We formalize the problem with combinatorial optimization models. We propose diverse time slot assignment policies and level of service measures. We perform a computational study to evaluate the impact of each policy on the quality of a solution, and to assess the overall effectiveness on the time slot assignment process.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Agatz, N., Campbell, A., Fleischmann, M., Savelsbergh, M.: Time slot management in attended home delivery. Transp. Sci. 45(3), 435–449 (2011)

    Article  Google Scholar 

  2. Campbell, A.M., Savelsbergh, M.: Incentive schemes for attended home delivery services. Transpo. Sci. 40(3), 327–341 (2006)

    Article  Google Scholar 

  3. Casazza, M., Ceselli, A., Létocart, L.: Dynamically negotiating time slots in attended home delivery. Univ. degli Studi di Milano—Dipartimento di Informatica, Technical report (2013)

    Google Scholar 

  4. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43, 367–371 (1995)

    Article  Google Scholar 

  5. Ehmke, J.F., Campbell, A.M.: Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur. J. Oper. Res. 233(1), 193–207 (2014)

    Article  Google Scholar 

  6. Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transp. Sci. 32(1), 12–29 (1998)

    Article  Google Scholar 

  7. Spliet, R., Desaulniers, G.: The discrete time window assignment vehicle routing problem. Technical report, HEC (2012)

    Google Scholar 

Download references

Acknowledgments

The authors wish to thank R. Wolfler Calvo and L. Bussi Roncalini. This work was partially funded by the Italian Ministry of Economic Development under the Industria 2015 contract n.MI01_00173—KITE.IT project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Ceselli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Casazza, M., Ceselli, A., Létocart, L. (2016). Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_14

Download citation

Publish with us

Policies and ethics