Optimising Routing in an Agent-Centric Synchromodal Network with Shared Information

  • 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

Our research focuses on synchromodal planning problems in which information is shared between all agents in the system and they choose their routes based on an individual optimisation objective. We show the effect of the information availability by develo** three different methods to determine the optimal paths, to motivate logistic players to cooperate in a synchromodal system.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
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 ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Akcelik, R.: Travel time functions for transport planning purposes: Davidson’s function, its time dependent form and alternative travel time function. Aust. Road Res. 21(3) (1991)

    Google Scholar 

  2. Ben-Akiva, M., Bierlaire, M., Bottom, J., Koutsopoulos, H., Mishalani, R.: Development of a route guidance generation system for real-time application. In: 8th IFAC Symposium on Transportation Systems. No. TRANSP-OR-CONF-2006-063 (1997)

    Google Scholar 

  3. Ben-Akiva, M., Bierlaire, M., Koutsopoulos, H., Mishalani, R.: DynaMIT: a simulation-based system for traffic prediction. In: DACCORD Short Term Forecasting Workshop, pp. 1–12 (1998)

    Google Scholar 

  4. Birge, J., Ho, J.: Optimal flows in stochastic dynamic networks with congestion. Oper. Res. 41(1), 203–216 (1993)

    Article  MathSciNet  Google Scholar 

  5. Carey, M., Subrahmanian, E.: An approach to modelling time-varying flows on congested networks. Transp. Res. Part B: Methodol. 34(3), 157–183 (2000)

    Article  Google Scholar 

  6. Dafermos, S.: Traffic equilibrium and variational inequalities. Transp. Sci. 14(1), 42–54 (1980)

    Article  MathSciNet  Google Scholar 

  7. De Juncker, M.: Optimising routing in an agent-centric synchromodal network with shared information. Master’s thesis, Eindhoven University of Technology (2017)

    Google Scholar 

  8. Dia, H.: An agent-based approach to modelling driver route choice behaviour under the influence of real-time information. Transp. Res. Part C Emerg. Technol. 10(5), 331–349 (2002)

    Article  MathSciNet  Google Scholar 

  9. Friesz, T., Luque, J., Tobin, R., Wie, B.: Dynamic network traffic assignment considered as a continuous time optimal control problem. Oper. Res. 37(6), 893–901 (1989)

    Article  MathSciNet  Google Scholar 

  10. Janson, B.: Convergent algorithm for dynamic traffic assignment. Transportation Research Record (1328) (1991)

    Google Scholar 

  11. Kaufman, D., Smith, R., Wunderlich, K.: User-equilibrium properties of fixed points in dynamic traffic assignment. Transp. Res. Part C Emerg. Technol. 6(1), 1–16 (1998)

    Article  Google Scholar 

  12. Mahmassani, H., Jayakrishnan, R.: System performance and user response under real-time information in a congested traffic corridor. Transp. Res. Part A Gen. 25(5), 293–307 (1991)

    Article  Google Scholar 

  13. Merchant, D., Nemhauser, G.: A model and an algorithm for the dynamic traffic assignment problems. Transp. Sci. 12(3), 183–199 (1978)

    Article  Google Scholar 

  14. Nagurney, A.: Network Economics: A Variational Inequality Approach, vol. 10. Springer Science & Business Media (2013)

    Google Scholar 

  15. Peeta, S., Mahmassani, H.: System optimal and user equilibrium time-dependent traffic assignment in congested networks. Ann. Oper. Res. 60(1), 81–113 (1995)

    Article  Google Scholar 

  16. Peeta, S., Ziliaskopoulos, A.: Foundations of dynamic traffic assignment: The past, the present and the future. Netw. Spat. Econ. 1(3), 233–265 (2001)

    Article  Google Scholar 

  17. Phillipson, F.: A thought on optimisation and self-organisation in synchromodal logistics. Technical report TNO (2017)

    Google Scholar 

  18. Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267–305 (1996)

    Article  MathSciNet  Google Scholar 

  19. Ran, B., Boyce, D., LeBlanc, L.: A new class of instantaneous dynamic user-optimal traffic assignment models. Oper. Res. 41(1), 192–202 (1993)

    Article  Google Scholar 

  20. Ran, B., Shimazaki, T.: A general model and algorithm for the dynamic traffic assignment problems. In: Transport Policy, Management & Technology Towards 2001: Selected Proceedings of the Fifth World Conference on Transport Research, vol. 4 (1989)

    Google Scholar 

  21. Tavasszy, L., Behdani, B., Konings, R.: Intermodality and synchromodality. SSRN Online (2015)

    Google Scholar 

  22. Ulmer, M.W., Heilig, L., Voß, S.: On the value and challenge of real-time information in dynamic dispatching of service vehicles. Bus. Inf. Syst. Eng. 59(3), 161–171 (2017)

    Article  Google Scholar 

  23. Wardrop, J.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, London (1900)

    Google Scholar 

  24. Ziliaskopoulos, A., Mahmassani, H.: Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transportation research record, pp. 94–94 (1993)

    Google Scholar 

Download references

Acknowledgement

This work has been carried out within the project ‘Complexity Methods for Predictive Synchromodality’ (Comet-PS), supported by NWO (the Netherlands Organisation for Scientific Research), TKI-Dinalog (Top Consortium Knowledge and Innovation) and the Early Research Program ‘Grip on Complexity’ of TNO (The Netherlands Organisation for Applied Scientific Research).

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

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

De Juncker, M.A.M., Phillipson, F., Bruijns, L.A.M., Sangers, A. (2018). Optimising Routing in an Agent-Centric Synchromodal Network with Shared Information. 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_21

Download citation

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

  • 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

Navigation