(Created page with " == Abstract == Four fundamental insights into transition methods are provided from the perspective of traffic engineers. An improved empirical transition method (i.e., Short...")
 
m (Scipediacontent moved page Draft Content 538730871 to Xu et al 2017b)
 
(No difference)

Latest revision as of 14:03, 12 February 2021

Abstract

Four fundamental insights into transition methods are provided from the perspective of traffic engineers. An improved empirical transition method (i.e., Shortest-way) is developed with the goal of reducing the time spent on offset correction and the offset deviations of the coordinated phases during the transition period. Shortest-way operates stepwise and can be activated to correct offset at the scheduled time to switch plans. The maximum amount of adjustment that can be made to a transition cycle length is calculated based on the timing parameters of active phases in the old and new plans. The problem of cycle length distribution is formulated as a nonlinear integer programming problem, aiming at minimizing the sum of the squares of the intersection offset deviations of all the transition cycles. The portion of the cycle length that can be allocated to each phase in a transition cycle is calculated based on its splits in the old and new plans and its potential contribution to the maximum amount of adjustment to the cycle length. The numerical experimental results proved the potential advantage of Shortest-way over CORSIM Shortway and justified the necessity for managing the time to switch plans at the intersection level.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

http://downloads.hindawi.com/journals/jat/2017/7670521.xml,
http://dx.doi.org/10.1155/2017/7670521
https://doaj.org/toc/0197-6729,
https://doaj.org/toc/2042-3195 under the license http://creativecommons.org/licenses/by/4.0/
http://downloads.hindawi.com/journals/jat/2017/7670521.pdf,
https://core.ac.uk/display/88193482,
https://academic.microsoft.com/#/detail/2600683524
Back to Top

Document information

Published on 01/01/2017

Volume 2017, 2017
DOI: 10.1155/2017/7670521
Licence: Other

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?