Skip to main content

Algorithms for the Dynamic Route Choice Model

  • Chapter
Dynamic Travel Choice Models
  • 99 Accesses

Abstract

In this chapter, algorithms are investigated for the dynamic user-optimal route choice model. All possible link interactions are first discussed in Section 5.1. A nested diagonalization method, embedding the Frank-Wolfe (FW) method, is then presented in Section 5.2. A nested projection method and a modified nested projection method are described in Sections 5.3 and 5.4, respectively. A numerical example is given to validate the correctness of the nested diagonalization method in Section 5.5. Finally, a concluding note is given in Section 5.6.

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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chen, HK. (1999). Algorithms for the Dynamic Route Choice Model. In: Dynamic Travel Choice Models. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59980-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59980-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64207-4

  • Online ISBN: 978-3-642-59980-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics