Modeling traffic congestion using simulation software
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Seongho | - |
dc.contributor.author | Suh, Wonho | - |
dc.date.accessioned | 2021-06-23T01:42:07Z | - |
dc.date.available | 2021-06-23T01:42:07Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2014-05 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/25824 | - |
dc.description.abstract | Traffic simulations are being increasingly utilized as transportation systems have become more complex and congested. However, most simulation models have limitations in overcapacity demand conditions. When traffic in a congested area fills the available roadway space additional traffic demand may never be allowed to enter the network. The intent of this paper is to explore one possible means to address the issue of unserved vehicles in overcapacity conditions using the VISSIM trip chain. The VISSIM trip chain feature is used for this analysis as it has the advantage of not eliminating a vehicle when congestion hinders its entrance onto a network, instead holding the vehicle until an acceptable gap exists on the entry link. A sample network is built to investigate the difference between standard traffic flow inputs and the trip chain method in overcapacity conditions. Also, simulations with different minimum space headway parameters in the priority rules are analyzed, allowing for an initial investigation into the sensitivity of the model to this parameter. Based on the analysis conducted it is concluded that, with appropriate calibrations, the trip chain feature in VISSIM is a potentially useful method to provide realistic modeling of various overcapacity conditions. © 2014 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Modeling traffic congestion using simulation software | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Suh, Wonho | - |
dc.identifier.doi | 10.1109/ICISA.2014.6847430 | - |
dc.identifier.scopusid | 2-s2.0-84904480387 | - |
dc.identifier.wosid | 000346134200106 | - |
dc.identifier.bibliographicCitation | ICISA 2014 - 2014 5th International Conference on Information Science and Applications, pp.1 - 3 | - |
dc.relation.isPartOf | ICISA 2014 - 2014 5th International Conference on Information Science and Applications | - |
dc.citation.title | ICISA 2014 - 2014 5th International Conference on Information Science and Applications | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 3 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Information Science & Library Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Information Science & Library Science | - |
dc.subject.keywordPlus | Chains | - |
dc.subject.keywordPlus | Complex networks | - |
dc.subject.keywordPlus | Computer simulation | - |
dc.subject.keywordPlus | Information science | - |
dc.subject.keywordPlus | Traffic congestion | - |
dc.subject.keywordPlus | Demand conditions | - |
dc.subject.keywordPlus | Microscopic simulation | - |
dc.subject.keywordPlus | Realistic model | - |
dc.subject.keywordPlus | Simulation software | - |
dc.subject.keywordPlus | Traffic demands | - |
dc.subject.keywordPlus | Traffic simulations | - |
dc.subject.keywordPlus | Transportation system | - |
dc.subject.keywordPlus | VISSIM | - |
dc.subject.keywordPlus | Computer software | - |
dc.subject.keywordAuthor | microscopic simulation | - |
dc.subject.keywordAuthor | traffic simulation software | - |
dc.subject.keywordAuthor | VISSIM | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6847430 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.