An Optimal Adaptive Routing Algorithm for Large-Scale Stochastic Time-Dependent Networks
-
2015-12-30
-
By Gao, Song
Details:
-
Creators:
-
Corporate Creators:
-
Corporate Contributors:
-
Subject/TRT Terms:
-
Resource Type:
-
Geographical Coverage:
-
TRIS Online Accession Number:01590495
-
Edition:Final Report
-
Corporate Publisher:
-
Abstract:The objective of this project is to develop an efficient algorithm and its computer implementation for the optimal adaptive routing problem that is 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, and Stockholm, Sweden. 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.
-
Format:
-
Funding:
-
Collection(s):
-
Main Document Checksum:
-
Download URL:
-
File Type: