Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||Raadsen, Mark P.H.||-|
|dc.contributor.author||Bliemer, Michiel C.J.||-|
|dc.description.abstract||Until the present day most static traffic assignment models are neither capacity constrained nor storage constrained. Recent studies have resulted in novel approaches that consider capacity constraints and sometimes storage constraints. We build upon the results of these works and the model formulated in our companion paper Bliemer and Raadsen (2018a) which comprises a static assignment model formulation that is both capacity constrained as well as storage constrained. The formulation of this model is derived from a continuous time dynamic network loading model proposed in Bliemer and Raadsen (2018b). The prospect of being able to capture spillback effects in static assignment provides new opportunities for making this modelling method more capable. It is well known that the absence of spillback typically results in significant underestimation of path travel times. This is especially true for paths that do not traverse bottleneck(s) directly, but that are affected by the space occupied of queues that are spilling back. Similar to Smith (2013) and Smith et al. (2013), Bliemer and Raadsen (2018a) did not provide a solution algorithm. In this paper, we take their model formulation and propose a general solution scheme suitable for large scale networks.||en_AU|
|dc.subject||static traffic assignment||en_AU|
|dc.subject||link transmission model||en_AU|
|dc.subject||strategic transport planning||en_AU|
|dc.subject.other||POST DG EXPORT SUBMISSION||en_AU|
|dc.title||General solution scheme for the Static Link Transmission Model||en_AU|
|Appears in Collections:||ITLS Working Papers 2018|
This work is protected by Copyright. All rights reserved. Access to this work is provided for the purposes of personal research and study. Except where permitted under the Copyright Act 1968, this work must not be copied or communicated to others without the express permission of the copyright owner. Use the persistent URI in this record to enable others to access this work.
|ITLS-WP-18-21.pdf||1.23 MB||Adobe PDF|
Items in Sydney eScholarship Repository are protected by copyright, with all rights reserved, unless otherwise indicated.