Skip to main content

Optimising and Recognising 2-Stage Delivery Chains with Time Windows

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10572))

Included in the following conference series:

  • 3568 Accesses

Abstract

In logistic delivery chains time windows are common. An arrival has to be in a certain time interval, at the expense of waiting time or penalties if the time limits are exceeded. This paper looks at the optimal placement of those time intervals in a specific case of a barge visiting two ports in sequence. For the second port a possible delay or penalty should be incorporated. Next, recognising these penalty structures in data is analysed to if see certain patterns in public travel data indicate that a certain dependency exists.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

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

    Article  Google Scholar 

  2. Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Computers & Operations Research 40(3), 856–866 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Armas, J., Melián-Batista, B., Moreno-Pérez, J.A., Brito, J.: GVNS for a real-world rich vehicle routing problem with time windows. Engineering Applications of Artificial Intelligence 42, 45–56 (2015)

    Article  Google Scholar 

  4. Batsyn, M., Kalyagin, V.: An analytical expression for the distribution of the sum of random variables with a mixed uniform density and mass function. In: Models, Algorithms, and Technologies for Network Analysis, pp. 51–63. Springer (2013)

    Google Scholar 

  5. Bushuev, M.A., Guiffrida, A.L.: Optimal position of supply chain delivery window: Concepts and general conditions. International Journal of Production Economics 137(2), 226–234 (2012)

    Article  Google Scholar 

  6. Garg, D., Narahari, Y., Viswanadham, N.: Achieving sharp deliveries in supply chains through variance pool allocation. European Journal of Operational Research 171(1), 227–254 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guiffrida, A.L., Nagi, R.: Cost characterizations of supply chain delivery performance. International Journal of Production Economics 102(1), 22–36 (2006)

    Article  Google Scholar 

  8. Hernandez, F., Gendreau, M., Potvin, J.Y.: Heuristics for tactical time slot management: a periodic vehicle routing problem view. International Transactions in Operational Research (2017)

    Google Scholar 

  9. Safaei, M., Issa, S., Seifert, M., Thoben, K.D., Lang, W.: A method to estimate the accumulated delivery time uncertainty in supply networks. In: Dynamics in Logistics, pp. 337–347. Springer (2013)

    Google Scholar 

  10. Safaei, M., Mehrsai, A., Thoben, K.D.: A computational method in analyzing of delivery time uncertainty for highly complex supply networks. Measurement 55, 549–563 (2014)

    Article  Google Scholar 

  11. Salani, M., Battarra, M., Gambardella, L.M.: Exact algorithms for the vehicle routing problem with soft time windows. In: Operations Research Proceedings 2014, pp. 481–486. Springer (2016)

    Google Scholar 

  12. Tanai, Y., Guiffrida, A.L.: Reducing the cost of untimely supply chain delivery performance for asymmetric laplace distributed delivery. Applied Mathematical Modelling 39(13), 3758–3770 (2015)

    Article  MathSciNet  Google Scholar 

  13. Vanany, I., Zailani, S., Pujawan, N.: Supply chain risk management: literature review and future research, pp. 16–33. IGI Global (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Phillipson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Phillipson, F., del Vecchyo, M.O., van Ginkel, B., Huizing, D., Sangers, A. (2017). Optimising and Recognising 2-Stage Delivery Chains with Time Windows. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68496-3_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68495-6

  • Online ISBN: 978-3-319-68496-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics