Unmanned traffic signal control is regarded as a sustainable intelligent management methodology. However, it faces the challenge of unpredictable traffic flow due to stochastic arrivals. The digital twin (DT) has emerged as a promising approach to address the challenges of time-varying traffic demand in urban transportation. Previous studies of DT-based adaptive traffic signal control (ATSC) methods all assume ideal synchronization conditions between the DT and the physical twin (PT). It means that the DT can immediately figure out the next neglecting limitation of realistic conditions, i.e., discrepancies between the DT and PT and computational ability. This paper proposes a DT-ATSC framework aimed at reducing the total delay at isolated intersections under limited synchronization conditions. The framework contains two parts: (1) a cell transmission model-based intersection simulation model featuring less computational consumption and the parameter self-calibration mechanism; and (2) scheme searching algorithms that can guide the DT to create optimization-oriented signal timing scheme candidates. Three options are provided for the scheme searching algorithms, i.e., grid search (GS), the genetic algorithm (GA), and Bayesian optimization (BO). A testing platform is created to validate the effectiveness of the proposed DT-ATSC. Experimental results indicate that the proposed DT-ATSC-BO outperforms the DT-ATSC-GA and DT-ATSC-GS. Meanwhile, the average vehicle delay of the DT-ATSC-BO is up to 53% lower than that of the current adaptive signal control method, which indicates that the proposed DT-ATSC has achieved the expected effect. Moreover, compared to the previous related work, the proposed DT-ATSC framework is more likely to be able to be applied in realistic situations because synchronization issues are incorporated in the design of the DT-ATSC by assuming a limited margin time for a decision.
6 January 2025 in IEEE Transactions on Intelligent Transportation Systems
Treating each intersection as basic agent, multi-agent reinforcement learning (MARL) methods have emerged as the predominant approach for distributed adaptive traffic signal control (ATSC) in multi-intersection scenarios, such as arterial coordination. MARL-based ATSC currently faces two challenges: disturbances from the control policies of other intersections may impair the learning and control stability of the agents; and the heterogeneous features across intersections may complicate coordination efforts. To address these challenges, this study proposes a novel MARL method for distributed ATSC in arterials, termed the Distributed Controller for Heterogeneous Intersections (DCHI). The DCHI method introduces a Neighborhood Experience Sharing (NES) framework, wherein each agent utilizes both local data and shared experiences from adjacent intersections to improve its control policy. Within this framework, the neural networks of each agent are partitioned into two parts following the Knowledge Homogenizing Encapsulation (KHE) mechanism. The first part manages heterogeneous intersection features and transforms the control experiences, while the second part optimizes homogeneous control logic. Experimental results demonstrate that the proposed DCHI achieves efficiency improvements in average travel time of over 30% compared to traditional methods and yields similar performance to the centralized sharing method. Furthermore, vehicle trajectories reveal that DCHI can adaptively establish green wave bands in a distributed manner. Given its superior control performance, accommodation of heterogeneous intersections, and low reliance on information networks, DCHI could significantly advance the application of MARL-based ATSC methods in practice.
5 June 2024 in IEEE Transactions on Intelligent Transportation Systems
The efficiency of road networks affects the daily activities of each stakeholder. Multi-agent reinforcement learning (MARL) has emerged as a method for managing network traffic signal control (TSC). It treats each intersection as an agent and coordinates their actions to enhance overall performance. A critical issue is enabling agents to appropriately and systematically respond to network demand changes. In response, this study proposes a coordination graph-based framework. It considers two adjacent intersections as a pair and updates coordination graphs periodically based on observed demand patterns, determining which intersection pairs should be coordinated. Within this framework, an adaptive TSC method based on reinforcement learning is designed for isolated intersections. Furthermore, paired intersections are jointly controlled using a modified max-plus algorithm. The coordination graph is solved considering factors such as traffic demand and intersection spacing, employing a decomposition method named “snake game solver”. Experimental results show that the individual learning scheme resulted in robust control and quick adaptability to traffic fluctuations. However, the coordination learning scheme only led to improvements when the inter-demand between intersections was sufficiently high and the spacing was short. The numerical study suggests that this control framework could enhance network efficiency compared to other MARL-TSC methods.
16 September 2022 in Mathematical Problems in Engineering
The increasing number of e-petition services requires accurate calculation methods to perform rapid and automated delivery. Automated text classification significantly reduces the burden of manual sorting, improving service efficiency. Moreover, existing text classification methods focus on improving sole models with an insufficient exploration of hybrid models. Moreover, existing research lacks combinatorial model selection schemes that yield satisfactory performance for petition classification applications. To address these issues, we propose a hybrid deep-learning classification model that can accurately classify the responsible department of a petition. First, e-petitions were collected from the Chinese bulletin board system and then cleaned, segmented, and tokenized into a sequence of words. Second, we employed the word2vec model to pretrain an embedding matrix based on the e-petition corpus. An embedding matrix maps words into vectors. Finally, a hybridized classifier based on convolutional neural networks (CNN) and bidirectional long short-term memory (Bi-LSTM) is proposed to extract features from the title and body of the petition. Compared with baseline models such as CNN, Bi-LSTM, and Bi-LSTM-CNN, the weighted F1 score of the proposed model is improved by 5.82, 4.31, and 1.58, respectively. Furthermore, the proposed automated petition classification decision support system is available on the e-petition website and can be used to accurately deliver petitions and conduct citizen opinion analysis.
24 September 2025 in Transportation Research Part C: Emerging Technologies
Consumer behavior analysis is of great significance to retail merchandise marketing. This article aims to establish a customer classification model that includes the complexity of customer shopping paths. First, we select a target area to capture the customer's movement path data. The path data contains a series of points with (x, y) coordinates. We plot the points into a path map via transforming the pixels from the (x, y) coordinates. In this stage, the points are connected by lines according to the time sequence. Secondly, the box-counting method is used to calculate the fractal dimension of each path map. Thirdly, we considered Gaussian function and distribution similarity to improve k-nearest neighbor (KNN) algorithm. In numerical experiments, we use our improved KNN algorithm to learn a customer classification model based on fractal dimension and stay time. Compared with support vector machine (SVM) and traditional KNN classification models, our improved KNN customer classification model has higher accuracy of 0.925 and higher F1-score of 0.926.