Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/71590
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electrical Engineering | en_US |
dc.creator | Tajtehranifard, H | en_US |
dc.creator | Bhaskar, A | en_US |
dc.creator | Nassir, N | en_US |
dc.creator | Haque, MM | en_US |
dc.creator | Chung, E | en_US |
dc.date.accessioned | 2018-01-23T02:25:48Z | - |
dc.date.available | 2018-01-23T02:25:48Z | - |
dc.identifier.issn | 0968-090X | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/71590 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | © 2018 Elsevier Ltd. All rights reserved. | en_US |
dc.rights | © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en_US |
dc.rights | The following publication Tajtehranifard, H., Bhaskar, A., Nassir, N., Haque, M. M., & Chung, E. (2018). A path marginal cost approximation algorithm for system optimal quasi-dynamic traffic assignment. Transportation Research Part C: Emerging Technologies, 88, 91-106 is available at https://dx.doi.org/10.1016/j.trc.2018.01.002 | en_US |
dc.subject | Quasi-dynamic traffic assignment | en_US |
dc.subject | System optimal traffic assignment | en_US |
dc.subject | Path marginal cost approximation | en_US |
dc.title | A path marginal cost approximation algorithm for system optimal quasi-dynamic traffic assignment | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 91 | en_US |
dc.identifier.epage | 106 | en_US |
dc.identifier.volume | 88 | en_US |
dc.identifier.doi | 10.1016/j.trc.2018.01.002 | en_US |
dcterms.abstract | This study introduces an efficient path-based System-Optimal Quasi-Dynamic Traffic Assignment (SOQDTA) framework that benefits from the computational efficiency of static traffic assignment models, yet captures the realism of traffic flow, with less complexity and a lower computational burden, compared to dynamic traffic assignment models. | en_US |
dcterms.abstract | To solve the proposed SOQDTA problem, we have developed a novel Path Marginal Cost (PMC) approximation algorithm, based on a Quasi-Dynamic Network Loading (QDNL) procedure (Bliemer et al., 2014), that incorporates a first order node model, and thus produces realistic path travel times consistent with queuing theory, and similar to those of dynamic network loading models, but at a lower computational cost. The model considers capacity constrained static flows, residual vertical/point queues and no spillback. | en_US |
dcterms.abstract | The proposed SOQDTA model is applied to the test network of Sioux Falls and is demonstrated to result in system optimal traffic flow patterns that improve total system travel times compared to the user equilibrium solution. In the case study experiment, the convergence of the algorithm is demonstrated using a relative gap function. A sensitivity analysis is performed to realize the impact of perturbation size on the solution quality, and a discussion is presented on the selection of perturbation size for general network applications. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Transportation research. Part C, Emerging technologies, Mar. 2018, v. 88, p. 91-106 | en_US |
dcterms.isPartOf | Transportation research. Part C, Emerging technologies | en_US |
dcterms.issued | 2018-03 | - |
dc.description.validate | 201801 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0150-n01 | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Tajtehranifard_Marginal_Cost_Algorithm.pdf | Pre-Published version | 1.62 MB | Adobe PDF | View/Open |
Page views
352
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
160
Citations as of Oct 13, 2024
SCOPUSTM
Citations
8
Last Week
0
0
Last month
Citations as of Jul 4, 2024
WEB OF SCIENCETM
Citations
10
Last Week
0
0
Last month
Citations as of Oct 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.