Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/65135
Title: Analysis of lane-blocking events with an analytical dynamic traffic assignment model
Authors: Lee, D.-H. 
Boyce, D.E.
Janson, B.N.
Keywords: Diagonalization algorithm
Diversion
Dynamic traffic assignment
Lane-blocking
Route choice
Variational inequality
Issue Date: Oct-2001
Source: Lee, D.-H.,Boyce, D.E.,Janson, B.N. (2001-10). Analysis of lane-blocking events with an analytical dynamic traffic assignment model. ITS Journal 6 (4) : 351-374. ScholarBank@NUS Repository.
Abstract: An analytical-based dynamic traffic assignment (DTA) model intended for off-line analysis and evaluation of non-recurring lane-blocking events is proposed. Formulated as a variational inequality (VI), this model solves an ideal dynamic user-optimal (DUO) route choice problem. A diagonalization algorithm is proposed to solve the model to a prespecified convergence using a large-scale, real-life traffic network. Adjustments of link capacities triggered by external lane-blocking events and internal modeled traffic phenomena are explicitly considered in the solution algorithm to capture queue formation and dissipation. The proposed solution procedure approximates route choices based on anticipatory and non-anticipatory traffic conditions to account for potential enroitte diversions caused by non-recurrent lane-blocking events. Model implementations, computational results, and conclusions are presented and discussed. The proposed model, solution procedure, and associated features demonstrate capabilities for realistic network-wide applications with ATMIS implications. Copyright © 2001 Taylor & Francis.
Source Title: ITS Journal
URI: http://scholarbank.nus.edu.sg/handle/10635/65135
ISSN: 10248072
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

15
checked on Dec 8, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.