File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Rhythmic Control of Automated Traffic—Part II: Grid Network Rhythm and Online Routing

TitleRhythmic Control of Automated Traffic—Part II: Grid Network Rhythm and Online Routing
Authors
KeywordsComputational scalability
Connected and automated vehicles
Online routing
Rhythmic control
Issue Date2021
Citation
Transportation Science, 2021, v. 55, n. 5, p. 988-1009 How to Cite?
AbstractConnected and automated vehicle (CAV) technology is providing urban transportation managers tremendous opportunities for better operation of urban mobility systems. However, there are significant challenges in real-time implementation as the computational time of the corresponding operations optimization model increases exponentially with increasing vehicle numbers. Following the companion paper (Chen et al. 2021), which proposes a novel automated traffic control scheme for isolated intersections, this study proposes a network-level, real-time traffic control framework for CAVs on grid networks. The proposed framework integrates a rhythmic control method with an online routing algorithm to realize collision-free control of all CAVs on a network and achieve superior performance in average vehicle delay, network traffic throughput, and computational scalability. Specifically, we construct a preset network rhythm that all CAVs can follow to move on the network and avoid collisions at all intersections. Based on the network rhythm, we then formulate online routing for the CAVs as a mixed integer linear program, which optimizes the entry times of CAVs at all entrances of the network and their time–space routings in real time. We provide a sufficient condition that the linear programming relaxation of the online routing model yields an optimal integer solution. Extensive numerical tests are conducted to show the performance of the proposed operations management framework under various scenarios. It is illustrated that the framework is capable of achieving negligible delays and increased network throughput. Furthermore, the computational time results are also promising. The CPU time for solving a collision-free control optimization problem with 2,000 vehicles is only 0.3 second on an ordinary personal computer.
Persistent Identifierhttp://hdl.handle.net/10722/336268
ISSN
2023 Impact Factor: 4.4
2023 SCImago Journal Rankings: 2.475
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLin, Xi-
dc.contributor.authorLi, Meng-
dc.contributor.authorShen, Zuo Jun Max-
dc.contributor.authorYin, Yafeng-
dc.contributor.authorHe, Fang-
dc.date.accessioned2024-01-15T08:25:03Z-
dc.date.available2024-01-15T08:25:03Z-
dc.date.issued2021-
dc.identifier.citationTransportation Science, 2021, v. 55, n. 5, p. 988-1009-
dc.identifier.issn0041-1655-
dc.identifier.urihttp://hdl.handle.net/10722/336268-
dc.description.abstractConnected and automated vehicle (CAV) technology is providing urban transportation managers tremendous opportunities for better operation of urban mobility systems. However, there are significant challenges in real-time implementation as the computational time of the corresponding operations optimization model increases exponentially with increasing vehicle numbers. Following the companion paper (Chen et al. 2021), which proposes a novel automated traffic control scheme for isolated intersections, this study proposes a network-level, real-time traffic control framework for CAVs on grid networks. The proposed framework integrates a rhythmic control method with an online routing algorithm to realize collision-free control of all CAVs on a network and achieve superior performance in average vehicle delay, network traffic throughput, and computational scalability. Specifically, we construct a preset network rhythm that all CAVs can follow to move on the network and avoid collisions at all intersections. Based on the network rhythm, we then formulate online routing for the CAVs as a mixed integer linear program, which optimizes the entry times of CAVs at all entrances of the network and their time–space routings in real time. We provide a sufficient condition that the linear programming relaxation of the online routing model yields an optimal integer solution. Extensive numerical tests are conducted to show the performance of the proposed operations management framework under various scenarios. It is illustrated that the framework is capable of achieving negligible delays and increased network throughput. Furthermore, the computational time results are also promising. The CPU time for solving a collision-free control optimization problem with 2,000 vehicles is only 0.3 second on an ordinary personal computer.-
dc.languageeng-
dc.relation.ispartofTransportation Science-
dc.subjectComputational scalability-
dc.subjectConnected and automated vehicles-
dc.subjectOnline routing-
dc.subjectRhythmic control-
dc.titleRhythmic Control of Automated Traffic—Part II: Grid Network Rhythm and Online Routing-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1287/trsc.2021.1061-
dc.identifier.scopuseid_2-s2.0-85102125319-
dc.identifier.volume55-
dc.identifier.issue5-
dc.identifier.spage988-
dc.identifier.epage1009-
dc.identifier.eissn1526-5447-
dc.identifier.isiWOS:000718930200002-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats