Scenario analyzer for real-time Dynamic Transportation Assignment (DTA) systems
Name
1065525323-MIT.pdf
Description
Full printable version
Size
6.1 MB
Format
Adobe PDF
Checksum (MD5)
d69dbf79fd60b76918917c00ea3f740d
Author(s)
Sui, Yihang
Advisor(s)
Moshe E. Ben-Akiva.
Date Issued
2018
Publisher
Massachusetts Institute of Technology
Abstract
The optimization of network control strategies using real-time Dynamic Traffic Assignment systems typically utilizes short-term predictions of the network state within a rolling horizon framework. However, there exist several network control instruments (such as incentive schemes under daily budget constraints) whose optimization necessitate generating predictions beyond the "roll period" and for the entire day. This work addresses the aforementioned problem by proposing a "Scenario Analyzer" to extend the horizon for the optimization problem by providing relatively accurate predictions and forecasting results for the extended horizon. The Scenario Analyzer module adopts a data driven approach, and is formulated as a matching problem utilizing an archived historical database. The archived historical database includes the data from DTA systems as master data table, daily run table and historical scenario table. The matching algorithms use the historical scenario table and master data table to pair the current run feature(s) with historical runs feature(s); after finding a match, the current run will be stored at the daily run table. The matching problem may be solved using different statistical or machine learning algorithms, in terms of: 1) single time step feature matching 2) multiple time steps features matching. The performance of the proposed scenario analyzer is examined for the optimization of an app-based travel incentive scheme to reduce system wide energy consumption (referred to as Tripod) in the Boston CBD network. The k-NN and KL divergence matching algorithms are tested for a simulation period of 6 AM - 9 PM. Results indicate that the scenario analyzer with k-NN outperforms KLD algorithm probably because KLD need more data points to fully-develop the time-series properties. Among all the traffic features using in the matching algorithms, the cumulative energy consumption is the best indicator for similarity comparison.
Description
Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 71-74).
Subjects
Civil and Environmental Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
