Predicting short-term urban traffic flow is a fundamental and cost-effective strategy in traffic signal control systems. However, due to the interrupted, periodic, and stochastic characteristics of urban traffic flow influenced by signal control, there are still unresolved issues related to the selection of the optimal aggregation time interval and the quantifiable uncertainties in prediction. To tackle these challenges, this research introduces a method for predicting urban interrupted traffic flow, which is based on Bayesian deep learning and considers the optimal aggregation time interval. Specifically, this method utilizes the cross-validation mean square error (CVMSE) method to obtain the optimal aggregation time interval and to establish the relationship between the optimal aggregation time interval and the signal cycle. A Bayesian LSTM-CNN prediction model, which extends the LSTM-CNN model under the Bayesian framework to a probabilistic model to better capture the stochasticity and variation in the data, is proposed. Experimental results derived from real-world data demonstrate gathering traffic flow data based on the optimal aggregation time interval significantly enhances the prediction accuracy of the urban interrupted traffic flow model. The optimal aggregation time interval for urban interrupted traffic flow data corresponds to a multiple of the traffic signal control cycle. Comparative experiments indicate that the Bayesian LSTM-CNN prediction model outperforms the state-of-the-art prediction models.

Vehicle re-identification aims to match and identify the same vehicle crossing multiple surveillance cameras and obtain traffic information such as travel time. The Automatic License Plate Recognition (ALPR) data are widely employed in urban surveillance. However, vehicle re-identification based on ALPR data is challenging due to license plate recognition errors and unrecognized issues. This paper proposes a vehicle matching algorithm designed to maximize the travel time probability using ALPR data, while accounting for recognition errors and unrecognized issues. The proposed algorithm consists of several modules, including the estimation of travel time distribution, computation of travel time probability, calculation of travel time confidence intervals and matching time window size, restricted fuzzy matching, and vehicle matching optimization. To evaluate the effectiveness of the proposed algorithm across varying lighting and weather conditions, ALPR data was collected from a survey road in four scenarios: sunny day, sunny night, rainy day, and rainy night. The results indicate that when compared to a sunny day scenario, severe lighting and adverse weather conditions lead to decreased matching accuracy and increased matching accuracy errors for all methods evaluated. However, our proposed model outperforms benchmark algorithms in both scenarios, demonstrating its superior performance.

Path planning for electric vehicles (EVs) can alleviate the limited cruising range and “range anxiety”. Many existing path optimization models cannot produce satisfactory solutions due to the imposition of too many assumptions and simplifications. The targeted optimal-path problem for electric vehicles (EV-TOP), which is proposed in the paper, aims at identifying the targeted optimal path for EVs under the limited battery level. It minimizes the travel cost, which is composed of the travel time and the total time that is spent at charging stations (CSs). The model is much more realistic due to the prediction and the consideration of the waiting times at CSs and more accurate approximations of the electricity consumption function and the charging function. Charging station information and the road traffic state are utilized to calculate the travel cost. The EV-TOP is decomposed into two subproblems: a constrained optimal path problem in the network (EV1-COP) and a shortest path problem in the meta-network (EV2-SP). To solve the EV1-COP, the Lagrangian relaxation algorithm, the simple efficient approximation (SEA) algorithm, and the Martins (MS) deletion algorithm are used. The EV2-SP is solved using Dijkstra’s algorithm. Thus, a polynomial-time approximation algorithm for the EV-TOP is developed. Finally, two computational studies are presented. The first study assesses the performance of the travel cost method. The second study evaluates the performance of our EV-TOP by comparing it with a well-known method.