An Optimal Adaptive Routing Algorithm for Large-Scale Stochastic Time-Dependent Networks

The objective of this project is to develop an efficient algorithm and its computer implementation for the optimal adaptive routing problem practical in large-scale real-life networks, where a traveler could revise the route choice based upon en route traffic information. Existing adaptive routing algorithms are for explorative purpose and can only be applied to hypothetical and simplified networks. In this project, important changes will be made to make the algorithm practical in real-life networks, in three major areas: memory, running time, and realistic features. The algorithm will be implemented and tested on both randomly generated networks and a number of real-life large networks, including those from the Pioneer Valley Planning Commission (PVPC) of Massachusetts, Stockholm, and Singapore. The developed algorithm is an important building block for the route choice module of an advanced traffic prediction model, and is also the intelligent core of a route guidance system.

  • Record URL:
  • Supplemental Notes:
    • Contract to a Performing Organization has not yet been awarded.


  • English


  • Status: Completed
  • Funding: $199988.00
  • Contract Numbers:



  • Sponsor Organizations:

    Research and Innovative Technology Administration

    University Transportation Centers Program
    1200 New Jersey Avenue, SE
    Washington, DC  United States  20590
  • Start Date: 20120602
  • Expected Completion Date: 0
  • Actual Completion Date: 20160131
  • Source Data: RiP Project 39218

Subject/Index Terms

Filing Info

  • Accession Number: 01556875
  • Record Type: Research project
  • Source Agency: New England University Transportation Center
  • Contract Numbers: DTRT12-G-UTC01, DTRT12-G-UTC01
  • Files: UTC, RiP
  • Created Date: Mar 13 2015 1:00AM