A Computational Algorithm for Instantaneous Dynamic User-Optimal Route Choice Models

  • Bin Ran
  • David E. Boyce
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 417)

Abstract

In this chapter, solution algorithms are considered for solving the instantaneous DUO route choice models presented in Chapter 5. A capability to solve the DUO route choice problem is needed for several reasons. First, it appears that properties of alternative models can only be fully understood by computing solutions to hypothetical and real test problems. Unlike their static counterparts, dynamic models are sufficiently opaque that they are difficult to understand analytically. Second, computational solutions for standard test problems based on actual networks are needed to evaluate how well alternative models describe reality. Third, solutions for large networks are required to evaluate the potential effectiveness of proposed in-vehicle navigation and route guidance systems. Ultimately, such models might be used to guide the operation of such systems; however, the requirements of such systems are so undefined at this time that any discussion of algorithmic requirements is highly speculative.

Keywords

Transportation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Bin Ran
    • 1
  • David E. Boyce
    • 2
  1. 1.Institute of Transportation StudiesUniversity of California at BerkeleyRichmondUSA
  2. 2.Urban Transportation CenterUniversity of Illinois at ChicagoChicagoUSA

Personalised recommendations