Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/168958
Title: | Spatial iterative coordination for parallel simulation-based optimization of large-scale traffic signal control | Authors: | Tan, Wen Jun Andelfinger, Philipp Cai, Wentong Eckhoff, David Knoll, Alois |
Keywords: | Engineering::Computer science and engineering | Issue Date: | 2023 | Source: | Tan, W. J., Andelfinger, P., Cai, W., Eckhoff, D. & Knoll, A. (2023). Spatial iterative coordination for parallel simulation-based optimization of large-scale traffic signal control. Simulation, 003754972311599-. https://dx.doi.org/10.1177/00375497231159944 | Journal: | Simulation | Abstract: | Applying simulation-based optimization to city-scale traffic signal optimization can be challenging due to the large search space resulting in high computational complexity. A divide-and-conquer approach can be used to partition the problem and optimized separately, which leads to faster convergence. However, the lack of coordination among the partial solutions may yield a poor-quality global solution. In this paper, we propose a new method for simulation-based optimization of traffic signal control, called spatially iterative coordination for parallel optimization (SICPO), to improve coordination among the partial solutions and reduce synchronization between the partitioned regions. The traffic scenario is simulated to obtain the interactions, which is used to spatially decompose the scenario into regions and identify interdependencies between the regions. Based on the regions, the problem is divided into subproblems which are optimized separately. To coordinate between the subproblems, the interactions between partial solutions are synchronized in two ways. First, multiple iterations of the optimization process can be executed to coordinate the partial solutions at the end of each optimization process. Second, the partial solutions can also be coordinated among the regions by synchronizing the trips across the regions. To reduce computational complexity, parallelism can be applied on two levels: each region is optimized concurrently, and each solution for a region is evaluated in parallel. We demonstrate our method on a real-world road network of Singapore, where SICPO converges to an average travel time 21.6% faster than global optimization at 62.8× shorter wall-clock time. | URI: | https://hdl.handle.net/10356/168958 | ISSN: | 0037-5497 | DOI: | 10.1177/00375497231159944 | Schools: | School of Computer Science and Engineering | Rights: | © 2023 The Author(s). All rights reserved. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | SCSE Journal Articles |
SCOPUSTM
Citations
50
3
Updated on Mar 21, 2025
Page view(s)
129
Updated on Mar 24, 2025
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.