Abstract

The graphical progression method can obtain grand coordinated schemes with minimal computational complexity. However, there is no standardized solution for this method, and only a few related studies have been found thus far. Therefore, based on the in-depth discussion of the graphical optimization theory mechanism, a process-oriented and high-efficiency graphical method for symmetrical bidirectional corridor progression is proposed in this study. A two-round rotation transformation optimization process of the progression trajectory characteristic lines (PTC lines) is innovatively proposed. By establishing the updated judgment criteria for coordinated mode, the first round of PTC line rotation transformation realizes the optimization of coordinated modes and initial offsets. Giving the conditions for stopping rotation transformation and determining rotation points, rotation directions, and rotation angles, the second round of PTC line rotation transformation achieves the final optimization of the common signal cycle and offsets. The case study shows that the proposed graphical method can obtain the optimal progression effect through regular graphing and solving, although it can also be solved by highly efficient programming.

Highlights

  • Intersections are the road network nodes that frequently cause traffic disruption, severe delays, and accidents in a city [1]. erefore, corridor progression has always been an effective way to ensure traffic safety and efficiency at intersections [2, 3]

  • We define the vertical scaling of the timespace diagram to realize the transformation of the optimization of the common signal cycle into the optimization of the corridor progression speed. e design process of the proposed graphical method is refined and organized as shown in Figure 1, which is mainly divided into four parts: initialization, the first round of rotation transformation, the second round of rotation transformation, and scheme generation

  • A symmetrical bidirectional corridor progression method based on graphical optimization theory is established in this study

Read more

Summary

Introduction

Intersections are the road network nodes that frequently cause traffic disruption, severe delays, and accidents in a city [1]. erefore, corridor progression has always been an effective way to ensure traffic safety and efficiency at intersections [2, 3]. Xu [19] expounded on the classical algebraic method, that is, to determine the optimal common signal cycle and offsets according to the ideal intersection distance that best matches the actual one. This method is only applicable under symmetrical phasing. Xu [19] provided the basic solution idea of the graphical method, but there are still many deficiencies during the solution process It lacked a specific design principle and well-defined rules for optimizing the common signal cycle and offsets.

Materials and Methods
Initialization
Conditions for Stopping the Rotation
Scheme Generation
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call