Skip to main content

A Study on Travel Time Stochasticity in Service Network Design with Quality Targets

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

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

Included in the following conference series:

Abstract

The scope of this paper is to advance the investigation into the importance of introducing uncertainty in service network design (SND) formulations by examining the uncertainty of travel times, a phenomenon that has been little studied up to now. The topic of our research thus is the stochastic scheduled service network design problem with service-quality targets and uncertainty on travel times, an important problem raising in the tactical planning process of consolidation-based freight carriers. Quality-service targets relate to the on-time operation of services and delivery of commodity flows to destinations. The problem is formulated as a two-stage mixed-integer linear stochastic model defined over a space-time network, with service targets modelled through penalties. Its aim is to define a cost-efficient transportation plan such that the chosen quality-service targets are respected as much as possible over time. An extensive experimental campaign is proposed using a large set of random generated instances with the scope of enhancing the understanding of the relations between the characteristics of a service network and its robustness, in terms of respect of the service schedule and delivery due dates, given business-as-usual fluctuations of travel times. Several analyses are reported identifying the features that appear in stochastic solutions to hedge against or, at least, reduce the bad effects of travel time uncertainty on the performance of a service network.

Supported by the Ministero dell’Istruzione, dell’Università e della Ricerca (MIUR) of Italy, through its Research Projects of Relevant National Interest (PRIN) program, the Sapienza Università di Roma, Italy, through its Progetto di Ateneo La Sapienza, and the Natural Sciences and Engineering Council of Canada (NSERC), through its Discovery Grant program.

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 EPUB and 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

References

  1. Assad, A.A.: Models for rail transportation. Transp. Res. Part A Policy Pract. 14, 205–220 (1980)

    Article  Google Scholar 

  2. Chapman, D.G.: Estimating the parameters of a truncated gamma distribution. Ann. Math. Stat. 27, 498–506 (1956)

    Article  MathSciNet  Google Scholar 

  3. Christiansen, M., Fagerholt, K., Ronen, D.: Ship routing and scheduling: status and perspectives. Transp. Sci. 38(1), 1–18 (2004)

    Article  Google Scholar 

  4. Cordeau, J.F., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transp. Sci. 32(4), 380–404 (1998)

    Article  Google Scholar 

  5. Crainic, T.G., Hewitt, M., Toulouse, M., Vu, D.M.: Service network design with resource constraints. Transp. Sci. 50(4), 1380–1393 (2014)

    Article  Google Scholar 

  6. Crainic, T.G.: Rail tactical planning: issues, models and tools. In: Bianco, L., Bella, A.L. (eds.) Freight Transport Planning and Logistics, pp. 463–509. Springer, Heidelberg (1988). https://doi.org/10.1007/978-3-662-02551-2_16

    Chapter  Google Scholar 

  7. Crainic, T.G.: Network design in freight transportation. Eur. J. Oper. Res. 122(2), 272–288 (2000)

    Article  Google Scholar 

  8. Crainic, T.G.: Long-haul freight transportation. In: Hall, R.W. (ed.) Handbook of Transportation Science, 2nd edn., pp. 451–516. Kluwer Academic Publishers, Norwell (2003)

    Google Scholar 

  9. Crainic, T.G., Kim, K.H.: Intermodal transportation. In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbooks in Operations Research and Management Science, Chap. 8, vol. 14, pp. 467–537. North-Holland, Amsterdam (2007)

    Google Scholar 

  10. Crainic, T.G., Roy, J.: O.R. tools for tactical freight transportation planning. Eur. J. Oper. Res. 33(3), 290–297 (1988)

    Article  Google Scholar 

  11. Kali, P., Wallace, S.W.: Stochastic Programming. Springer, Heidelberg (1994). https://doi.org/10.1007/978-3-642-88272-2

    Book  Google Scholar 

  12. Lanza, G., Crainic, T.G., Rei, W., Ricciardi, N.: Service network design problem with quality targets and stochastic travel times. CIRRELT-2017-71 (2017)

    Google Scholar 

  13. Lium, A.G., Crainic, T.G., Wallace, S.W.: A study of demand stochasticity in service network design. Transp. Sci. 43(2), 144–157 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giacomo Lanza .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lanza, G., Crainic, T.G., Rei, W., Ricciardi, N. (2018). A Study on Travel Time Stochasticity in Service Network Design with Quality Targets. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00898-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00897-0

  • Online ISBN: 978-3-030-00898-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics