Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2021/7649214 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550577749360640 |
|---|---|
| author | Kai Lu Shuyan Jiang Yiming Zhao Yongjie Lin Yinhai Wang |
| author_facet | Kai Lu Shuyan Jiang Yiming Zhao Yongjie Lin Yinhai Wang |
| author_sort | Kai Lu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-9e087d7802194c49a0eb6c7c937ce154 |
| institution | Kabale University |
| issn | 2042-3195 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-9e087d7802194c49a0eb6c7c937ce1542025-02-03T06:06:26ZengWileyJournal of Advanced Transportation2042-31952021-01-01202110.1155/2021/7649214Graphical Optimization Method for Symmetrical Bidirectional Corridor ProgressionKai Lu0Shuyan Jiang1Yiming Zhao2Yongjie Lin3Yinhai Wang4South China University of TechnologySouth China University of TechnologySouth China University of TechnologySouth China University of TechnologyUniversity of WashingtonThe 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.http://dx.doi.org/10.1155/2021/7649214 |
| spellingShingle | Kai Lu Shuyan Jiang Yiming Zhao Yongjie Lin Yinhai Wang Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression Journal of Advanced Transportation |
| title | Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression |
| title_full | Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression |
| title_fullStr | Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression |
| title_full_unstemmed | Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression |
| title_short | Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression |
| title_sort | graphical optimization method for symmetrical bidirectional corridor progression |
| url | http://dx.doi.org/10.1155/2021/7649214 |
| work_keys_str_mv | AT kailu graphicaloptimizationmethodforsymmetricalbidirectionalcorridorprogression AT shuyanjiang graphicaloptimizationmethodforsymmetricalbidirectionalcorridorprogression AT yimingzhao graphicaloptimizationmethodforsymmetricalbidirectionalcorridorprogression AT yongjielin graphicaloptimizationmethodforsymmetricalbidirectionalcorridorprogression AT yinhaiwang graphicaloptimizationmethodforsymmetricalbidirectionalcorridorprogression |