Jishun Ou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jishun Ou has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
Jingxin Xia
Intelligent Transportation System Research Center, Southeast University, Nanjing, China
4 shared publicationsChengchuan An
Intelligent Transportation System Research Center, Southeast University
3 shared publications- Jiawei Lu
School of Sustainable Engineering and the Built Environment, Arizona State University, Tempe, AZ
3 shared publications - Jingxin Xia
Intelligent Transportation System Research Center, Southeast University, Nanjing, China
3 shared publications Qinghui Nie
School of Civil Engineering and Transportation, Yangzhou University
3 shared publications- Qinghui Nie
College of Architectural Science and Engineering, Yangzhou University, Yangzhou 225127, China
3 shared publications
Latest Publications
- 3 November 2026
- Published by Taylor & Francis in Journal of Intelligent Transportation Systems
- p. 1-21
Physical structure embedded model for bus arrival time prediction
1. Rapid urbanization has led to severe traffic congestion in many cities, resulting in significant economic losses and adverse effects on residents’ health and quality of life. Enhancing the effic...
- 3 November 2026
- Published by Taylor & Francis in Journal of Intelligent Transportation Systems
- p. 1-21
Physical structure embedded model for bus arrival time prediction
1. Rapid urbanization has led to severe traffic congestion in many cities, resulting in significant economic losses and adverse effects on residents’ health and quality of life. Enhancing the effic...
- Open Access
Understanding Congestion Evolution in Urban Traffic Systems Across Multiple Spatiotemporal Scales: A Causal Emergence Perspective
Understanding how congestion forms and propagates over space and time is essential for improving the operational efficiency of urban traffic systems. Recent developments in causal emergence theory indicate that the causal structures underlying dynamic models are scale-dependent. Most existing studies on traffic congestion evolution focus on a single, fixed scale, which risks overlooking clearer causal patterns at other scales and thus limiting predictive power and practical applicability. To address this, we develop a multiscale congestion evolution modeling framework grounded in causal emergence theory. Within this framework we build dynamical models at multiple spatiotemporal scales using dynamic Bayesian networks (DBNs) and quantify the causal strength of these models using effective information (EI) and singular value decomposition (SVD)-based diagnostics. Using road networks from three central Kunshan regions, we validate the proposed framework across 24 spatiotemporal scales and five demand scenarios. Across all three regions and the tested scales, we observe evidence of causal emergence in congestion evolution dynamics. When results are pooled across regions and scenarios, models built at the 10 min/150 m scale exhibit stronger and more coherent causal structure than models at other scales. These findings demonstrate that the proposed framework can identify and help build dynamical models of congestion evolution at appropriate spatiotemporal scales, thereby supporting the development of proactive traffic management and effective resilience enhancement strategies for urban transport systems.
Open AccessUnderstanding Congestion Evolution in Urban Traffic Systems Across Multiple Spatiotemporal Scales: A Causal Emergence Perspective
Understanding how congestion forms and propagates over space and time is essential for improving the operational efficiency of urban traffic systems. Recent developments in causal emergence theory indicate that the causal structures underlying dynamic models are scale-dependent. Most existing studies on traffic congestion evolution focus on a single, fixed scale, which risks overlooking clearer causal patterns at other scales and thus limiting predictive power and practical applicability. To address this, we develop a multiscale congestion evolution modeling framework grounded in causal emergence theory. Within this framework we build dynamical models at multiple spatiotemporal scales using dynamic Bayesian networks (DBNs) and quantify the causal strength of these models using effective information (EI) and singular value decomposition (SVD)-based diagnostics. Using road networks from three central Kunshan regions, we validate the proposed framework across 24 spatiotemporal scales and five demand scenarios. Across all three regions and the tested scales, we observe evidence of causal emergence in congestion evolution dynamics. When results are pooled across regions and scenarios, models built at the 10 min/150 m scale exhibit stronger and more coherent causal structure than models at other scales. These findings demonstrate that the proposed framework can identify and help build dynamical models of congestion evolution at appropriate spatiotemporal scales, thereby supporting the development of proactive traffic management and effective resilience enhancement strategies for urban transport systems.
- 7 February 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
A robust integrated multi-strategy bus control system via deep reinforcement learning
- 7 February 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
A robust integrated multi-strategy bus control system via deep reinforcement learning
- 9 March 2023
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2677 (8) , 509-524
Reliable Traffic State Identification Using High-Resolution Data: A Consistent Offline-Online Dynamic Time Warping–Based Time Series Clustering Approach
Reliable real-time traffic state identification (TSI) provides key support for traffic management and control. Although substantial efforts have been devoted to TSI, considering the high dynamics and stochasticity of traffic flows, there remain challenges in providing reliable and consistent TSI results, especially in online network–level applications. In this study, we propose a time series clustering-based offline-online modeling framework for reliable TSI using high-resolution traffic data. Specifically, in the proposed framework, the offline module extracts representative traffic state patterns from massive historical data, which serve as the state references in the online module when performing real-time TSI with streaming information. Instead of point data, the proposed framework uses high-resolution traffic data in the form of time series, providing rich information on traffic flows and details on their short-term fluctuations and stable long-term trends. In the offline module, considering the fuzziness of traffic states, we introduce a fuzzy c-means based clustering method for offline traffic flow series clustering and traffic state pattern extraction, within which the dynamic time warping algorithm is adopted for measuring the similarity between different time series, and the optimal number of clusters is determined by a proposed critical segment–based method to reach consistent TSI in network-wide applications. In the online module, a dynamic programming–based real-time TSI approach is developed to produce reliable and smooth identification results. Extensive numerical experiments on a 20-mi-long freeway corridor in California, USA, were performed to validate the proposed framework. Results demonstrate the effectiveness of the proposed framework.
- 9 March 2023
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2677 (8) , 509-524
Reliable Traffic State Identification Using High-Resolution Data: A Consistent Offline-Online Dynamic Time Warping–Based Time Series Clustering Approach
Reliable real-time traffic state identification (TSI) provides key support for traffic management and control. Although substantial efforts have been devoted to TSI, considering the high dynamics and stochasticity of traffic flows, there remain challenges in providing reliable and consistent TSI results, especially in online network–level applications. In this study, we propose a time series clustering-based offline-online modeling framework for reliable TSI using high-resolution traffic data. Specifically, in the proposed framework, the offline module extracts representative traffic state patterns from massive historical data, which serve as the state references in the online module when performing real-time TSI with streaming information. Instead of point data, the proposed framework uses high-resolution traffic data in the form of time series, providing rich information on traffic flows and details on their short-term fluctuations and stable long-term trends. In the offline module, considering the fuzziness of traffic states, we introduce a fuzzy c-means based clustering method for offline traffic flow series clustering and traffic state pattern extraction, within which the dynamic time warping algorithm is adopted for measuring the similarity between different time series, and the optimal number of clusters is determined by a proposed critical segment–based method to reach consistent TSI in network-wide applications. In the online module, a dynamic programming–based real-time TSI approach is developed to produce reliable and smooth identification results. Extensive numerical experiments on a 20-mi-long freeway corridor in California, USA, were performed to validate the proposed framework. Results demonstrate the effectiveness of the proposed framework.
- 4 November 2022
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 166, 143-182
Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation
- 4 November 2022
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 166, 143-182
Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation
- Open Access
Traffic Volatility Forecasting Using an Omnibus Family GARCH Modeling Framework
Traffic volatility modeling has been highly valued in recent years because of its advantages in describing the uncertainty of traffic flow during the short-term forecasting process. A few generalized autoregressive conditional heteroscedastic (GARCH) models have been developed to capture and hence forecast the volatility of traffic flow. Although these models have been confirmed to be capable of producing more reliable forecasts than traditional point forecasting models, the more or less imposed restrictions on parameter estimations may make the asymmetric property of traffic volatility be not or insufficiently considered. Furthermore, the performance of the models has not been fully evaluated and compared in the traffic forecasting context, rendering the choice of the models dilemmatic for traffic volatility modeling. In this study, an omnibus traffic volatility forecasting framework is proposed, where various traffic volatility models with symmetric and asymmetric properties can be developed in a unifying way by fixing or flexibly estimating three key parameters, namely the Box-Cox transformation coefficient , the shift factor , and the rotation factor . Extensive traffic speed datasets collected from urban roads of Kunshan city, China, and from freeway segments of the San Diego Region, USA, were used to evaluate the proposed framework and develop traffic volatility forecasting models in a number of case studies. The models include the standard GARCH, the threshold GARCH (TGARCH), the nonlinear ARCH (NGARCH), the nonlinear-asymmetric GARCH (NAGARCH), the Glosten–Jagannathan–Runkle GARCH (GJR-GARCH), and the family GARCH (FGARCH). The mean forecasting performance of the models was measured with mean absolute error (MAE) and mean absolute percentage error (MAPE), while the volatility forecasting performance of the models was measured with volatility mean absolute error (VMAE), directional accuracy (DA), kickoff percentage (KP), and average confidence length (ACL). Experimental results demonstrate the effectiveness and flexibility of the proposed framework and provide insights into how to develop and select proper traffic volatility forecasting models in different situations.Open AccessTraffic Volatility Forecasting Using an Omnibus Family GARCH Modeling Framework
Traffic volatility modeling has been highly valued in recent years because of its advantages in describing the uncertainty of traffic flow during the short-term forecasting process. A few generalized autoregressive conditional heteroscedastic (GARCH) models have been developed to capture and hence forecast the volatility of traffic flow. Although these models have been confirmed to be capable of producing more reliable forecasts than traditional point forecasting models, the more or less imposed restrictions on parameter estimations may make the asymmetric property of traffic volatility be not or insufficiently considered. Furthermore, the performance of the models has not been fully evaluated and compared in the traffic forecasting context, rendering the choice of the models dilemmatic for traffic volatility modeling. In this study, an omnibus traffic volatility forecasting framework is proposed, where various traffic volatility models with symmetric and asymmetric properties can be developed in a unifying way by fixing or flexibly estimating three key parameters, namely the Box-Cox transformation coefficient , the shift factor , and the rotation factor . Extensive traffic speed datasets collected from urban roads of Kunshan city, China, and from freeway segments of the San Diego Region, USA, were used to evaluate the proposed framework and develop traffic volatility forecasting models in a number of case studies. The models include the standard GARCH, the threshold GARCH (TGARCH), the nonlinear ARCH (NGARCH), the nonlinear-asymmetric GARCH (NAGARCH), the Glosten–Jagannathan–Runkle GARCH (GJR-GARCH), and the family GARCH (FGARCH). The mean forecasting performance of the models was measured with mean absolute error (MAE) and mean absolute percentage error (MAPE), while the volatility forecasting performance of the models was measured with volatility mean absolute error (VMAE), directional accuracy (DA), kickoff percentage (KP), and average confidence length (ACL). Experimental results demonstrate the effectiveness and flexibility of the proposed framework and provide insights into how to develop and select proper traffic volatility forecasting models in different situations. - Open Access
- 3 January 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (1) , 356
Short-Term Traffic Flow Forecasting via Multi-Regime Modeling and Ensemble Learning
Short-term traffic flow forecasting is crucial for proactive traffic management and control. One key issue associated with the task is how to properly define and capture the temporal patterns of traffic flow. A feasible solution is to design a multi-regime strategy. In this paper, an effective approach to forecasting short-term traffic flow based on multi-regime modeling and ensemble learning is presented. First, to properly capture the different patterns of traffic flow dynamics, a regime identification model based on probabilistic modeling was developed. Each identified regime represents a specific traffic phase, and was used as the representative feature for the forecasting modeling. Second, a forecasting model built on an ensemble learning strategy was developed, which integrates the forecasts of multiple regression trees. The traffic flow data over 5-min intervals collected from four I-80 freeway segments, in California, USA, was used to evaluate the proposed approach. The experimental results show that the identified regimes are able to well explain the different traffic phases, and play an important role in forecasting. Furthermore, the developed forecasting model outperformed four typical models in terms of root mean square error (RMSE) and mean absolute percentage error (MAPE) on three traffic flow measures.
- 3 January 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (1) , 356
Open AccessShort-Term Traffic Flow Forecasting via Multi-Regime Modeling and Ensemble Learning
Short-term traffic flow forecasting is crucial for proactive traffic management and control. One key issue associated with the task is how to properly define and capture the temporal patterns of traffic flow. A feasible solution is to design a multi-regime strategy. In this paper, an effective approach to forecasting short-term traffic flow based on multi-regime modeling and ensemble learning is presented. First, to properly capture the different patterns of traffic flow dynamics, a regime identification model based on probabilistic modeling was developed. Each identified regime represents a specific traffic phase, and was used as the representative feature for the forecasting modeling. Second, a forecasting model built on an ensemble learning strategy was developed, which integrates the forecasts of multiple regression trees. The traffic flow data over 5-min intervals collected from four I-80 freeway segments, in California, USA, was used to evaluate the proposed approach. The experimental results show that the identified regimes are able to well explain the different traffic phases, and play an important role in forecasting. Furthermore, the developed forecasting model outperformed four typical models in terms of root mean square error (RMSE) and mean absolute percentage error (MAPE) on three traffic flow measures.
- Open Access
- 29 July 2019
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 35 (2) , 178-199
A data-driven approach to determining freeway incident impact areas with fuzzy and graph theory-based clustering
- 29 July 2019
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 35 (2) , 178-199
Open AccessA data-driven approach to determining freeway incident impact areas with fuzzy and graph theory-based clustering
- Open Access
- 3 April 2019
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 13 (7) , 1154-1163
Freeway travel time estimation based on the general motors model: a genetic algorithm calibration framework
Travel time estimation plays an important role in freeway performance assessment and reliability management. Conventional estimation methods based on speed information do not consider the level of congestion during modelling, leading to unreliable estimations under congested conditions. This study presents a freeway travel time estimation method based on the general motors (GM) model, where the concept ‘virtual vehicle’ was proposed to apply macroscopic traffic flow data to the microscopic GM model. First, a GM‐based travel time estimation (GMTTE) model was developed to estimate link travel time. Three sets of parameters , and were separately used under free‐flowing, congestion and transition conditions. Next, two corridor estimation models, namely GMTTE time‐slice‐based (GMTTE‐TSB) model and GMTTE continuous‐speed (GMTTE‐CS) model, were proposed. To calibrate the three parameters, a genetic algorithm framework was developed. The proposed method was calibrated and evaluated using traffic data collected from seven freeway segments in the greater St. Louis, Missouri region. Results show that (i) the GMTTE‐CS model outperformed the GMTTE‐TSB model; (ii) the optimal parameters of the GMTTE‐CS model under free‐flowing and congested conditions are and , respectively; (iii) the GMTTE‐CS model outperformed the instantaneous and time‐slice models under congested conditions, while showing similar accuracies with the two models under free‐flowing and status‐transition conditions; and (iv) the optimal time interval was found to be 9–10 min for free‐flowing conditions and 6–7 min for congested conditions.
- 3 April 2019
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 13 (7) , 1154-1163
Open AccessFreeway travel time estimation based on the general motors model: a genetic algorithm calibration framework
Travel time estimation plays an important role in freeway performance assessment and reliability management. Conventional estimation methods based on speed information do not consider the level of congestion during modelling, leading to unreliable estimations under congested conditions. This study presents a freeway travel time estimation method based on the general motors (GM) model, where the concept ‘virtual vehicle’ was proposed to apply macroscopic traffic flow data to the microscopic GM model. First, a GM‐based travel time estimation (GMTTE) model was developed to estimate link travel time. Three sets of parameters , and were separately used under free‐flowing, congestion and transition conditions. Next, two corridor estimation models, namely GMTTE time‐slice‐based (GMTTE‐TSB) model and GMTTE continuous‐speed (GMTTE‐CS) model, were proposed. To calibrate the three parameters, a genetic algorithm framework was developed. The proposed method was calibrated and evaluated using traffic data collected from seven freeway segments in the greater St. Louis, Missouri region. Results show that (i) the GMTTE‐CS model outperformed the GMTTE‐TSB model; (ii) the optimal parameters of the GMTTE‐CS model under free‐flowing and congested conditions are and , respectively; (iii) the GMTTE‐CS model outperformed the instantaneous and time‐slice models under congested conditions, while showing similar accuracies with the two models under free‐flowing and status‐transition conditions; and (iv) the optimal time interval was found to be 9–10 min for free‐flowing conditions and 6–7 min for congested conditions.
- Open Access
- 25 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 26967-26983
Learn, Assign, and Search: Real-Time Estimation of Dynamic Origin-Destination Flows Using Machine Learning Algorithms
A common way to estimate dynamic O-D flows is to establish and solve a bilevel optimization model. Though numerous efforts have been devoted to effectively and efficiently solving the model, challenges still exist because of the interdependence of jointly solving the upper-level O-D estimation and lower-level traffic assignment problems and the nonconvexity of the model. This paper presents an alternative framework for estimating dynamic O-D flows using machine learning algorithms. The framework consists of three major modules: a learner that learns the dynamic mapping patterns describing the relationship between prior O-D flows and observed link flows, an assigner that assigns a given OD matrix to different links based on the learner, and a searcher that iteratively searches the optimal O-D solution using the assigner. A convolutional neural network is designed as the learner and trained as the assigner. Next, the algorithms to estimate a regular O-D matrix and real-time O-D flows are separately developed by using the assigner and two designed Genetic Algorithms built as the searcher. The framework was evaluated with a realistic network at the downtown area of Kunshan, China. Experimental studies show the framework can achieve satisfactory estimation performances in real time. Meanwhile, it takes raw flow ranges as the prior inputs, making it robust in the case of lacking an accurate target O-D matrix.
- 25 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 26967-26983
Open AccessLearn, Assign, and Search: Real-Time Estimation of Dynamic Origin-Destination Flows Using Machine Learning Algorithms
A common way to estimate dynamic O-D flows is to establish and solve a bilevel optimization model. Though numerous efforts have been devoted to effectively and efficiently solving the model, challenges still exist because of the interdependence of jointly solving the upper-level O-D estimation and lower-level traffic assignment problems and the nonconvexity of the model. This paper presents an alternative framework for estimating dynamic O-D flows using machine learning algorithms. The framework consists of three major modules: a learner that learns the dynamic mapping patterns describing the relationship between prior O-D flows and observed link flows, an assigner that assigns a given OD matrix to different links based on the learner, and a searcher that iteratively searches the optimal O-D solution using the assigner. A convolutional neural network is designed as the learner and trained as the assigner. Next, the algorithms to estimate a regular O-D matrix and real-time O-D flows are separately developed by using the assigner and two designed Genetic Algorithms built as the searcher. The framework was evaluated with a realistic network at the downtown area of Kunshan, China. Experimental studies show the framework can achieve satisfactory estimation performances in real time. Meanwhile, it takes raw flow ranges as the prior inputs, making it robust in the case of lacking an accurate target O-D matrix.