Skip to main content

Service and Transfer Selection for Freights in a Synchromodal Network

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

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

Included in the following conference series:

Abstract

We study the problem of selecting services and transfers in a synchromodal network to transport freights with different characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new freights that arrive each period. Although freights become known gradually over time, the planner has probabilistic knowledge about their arrival. Using this knowledge, the planner balances current and future costs at each period, with the objective of minimizing the expected costs over the entire horizon. To model this stochastic finite horizon optimization problem, we propose a Markov Decision Process (MDP) model. To overcome the computational complexity of solving the MDP, we propose a heuristic approach based on approximate dynamic programming. Using different problem settings, we show that our look-ahead approach has significant benefits compared to a benchmark heuristic.

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. Bai, R., Wallace, S.W., Li, J., Chong, A.Y.L.: Stochastic service network design with rerouting. Transp. Res. Part B 60, 50–65 (2014)

    Article  Google Scholar 

  2. Caris, A., Macharis, C., Janssens, G.K.: Decision support in intermodal transport: a new research agenda. Comput. Ind. 64(2), 105–112 (2013). Decision Support for Intermodal Transport

    Article  Google Scholar 

  3. Crainic, T.G., Hewitt, M., Rei, W.: Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Comput. Oper. Res. 43, 90–99 (2014)

    Article  MathSciNet  Google Scholar 

  4. Dall’Orto, L.C., Crainic, T.G., Leal, J.E., Powell, W.B.: The single-node dynamic service scheduling and dispatching problem. Eur. J. Oper. Res. 170(1), 1–23 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ghane-Ezabadi, M., Vergara, H.A.: Decomposition approach for integrated intermodal logistics network design. Transp. Res. Part E 89, 53–69 (2016)

    Article  Google Scholar 

  6. Li, L., Negenborn, R.R., Schutter, B.D.: Intermodal freight transport planning a receding horizon control approach. Transp. Res. Part C 60, 77–95 (2015)

    Article  Google Scholar 

  7. 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 

  8. Lo, H.K., An, K., Lin, W.H.: Ferry service network design under demand uncertainty. Transp. Res. Part E 59, 48–70 (2013)

    Article  Google Scholar 

  9. Mes, M.R.K., Iacob, M.E.: Synchromodal transport planning at a logistics service provider. In: Zijm, H., Klumpp, M., Clausen, U., ten Hompel, M. (eds.) Logistics and Supply Chain Innovation: Bridging the Gap Between Theory and Practice, pp. 23–36. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

  10. Nabais, J., Negenborn, R., Bentez, R.C., Botto, M.A.: Achieving transport modal split targets at intermodal freight hubs using a model predictive approach. Transp. Res. Part C 60, 278–297 (2015)

    Article  Google Scholar 

  11. Rivera, A.P., Mes, M.: Dynamic multi-period freight consolidation. In: Corman, F., Voß, S., Negenborn, R.R. (eds.) ICCL 2015. LNCS, vol. 9335, pp. 370–385. Springer, Heidelberg (2015). doi:10.1007/978-3-319-24264-4_26

    Chapter  Google Scholar 

  12. Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality, 2nd edn. Wiley, Hoboken (2011)

    Book  MATH  Google Scholar 

  13. Riessen, B., Negenborn, R.R., Dekker, R.: Synchromodal container transportation: an overview of current topics and research opportunities. In: Corman, F., Voß, S., Negenborn, R.R. (eds.) ICCL 2015. LNCS, vol. 9335, pp. 386–397. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  14. SteadieSeifi, M., Dellaert, N., Nuijten, W., Woensel, T.V., Raoufi, R.: Multimodal freight transportation planning: a literature review. Eur. J. Oper. Res. 233(1), 1–15 (2014)

    Article  MATH  Google Scholar 

  15. Wieberneit, N.: Service network design for freight transportation: a review. OR Spectrum 30(1), 77–112 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  16. Zhang, M., Pel, A.: Synchromodal hinterland freight transport: model study for the port of Rotterdam. J. Transp. Geogr. 52, 1–10 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arturo PĂ©rez Rivera .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

PĂ©rez Rivera, A., Mes, M. (2016). Service and Transfer Selection for Freights in a Synchromodal Network. In: Paias, A., Ruthmair, M., VoĂź, S. (eds) Computational Logistics. ICCL 2016. Lecture Notes in Computer Science(), vol 9855. Springer, Cham. https://doi.org/10.1007/978-3-319-44896-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44896-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44895-4

  • Online ISBN: 978-3-319-44896-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics