Electric vehicle charging stations are widespread but suffer from long charging times. In contrast, battery swapping stations have gained attention due to their efficiency and small footprint. However, there is a lack of extensive discussion on their layout, operation modes, and scheduling algorithms. This paper discusses the layout-dispatching-scheduling model of battery swapping stations and super battery swapping stations under centralized charging and unified dispatch. Considering battery swapping stations service time and electric vehicles queuing, a queuing-aware location-routing problem is proposed and solved using Gurobi. This study tackles the uncertainty in electric vehicle spatio-temporal dispatch by formulating the battery scheduling process between super battery swapping stations and battery swapping stations as a vehicle routing problem with time windows and uncertain demand. To address this challenge, the study proposes an adaptive routing optimization method based on an improved proximal policy optimization algorithm. Additionally, it investigates a flexible charging strategy for super battery swapping stations, where the battery charging and discharging process is modeled as a Markov decision process. To optimize operational revenue, meet demand, enable grid interactions, and contribute to peak shaving, the study employs a deep reinforcement learning approach that utilizes the twin delayed deep deterministic policy gradient algorithm. The system design is proven to be feasible and capable of meeting operational requirements.

Since emergency vehicles (EMVs) in urban transit systems play a crucial role in responding to time-critical events, the quick response of EMVs is essential for improving the success rate of rescue operations and minimizing property loss. Booming connected vehicle (CV) technology provides a new perspective to further enhance the effectiveness of EMV priority. Based on this CV technology, we propose a cooperative multiple EMV priority model in which the speed, acceleration, and lane changing actions of both the EMVs and surrounding ordinary vehicles (OVs) are set as decision variables. This proposed model is rigorously formulated in integer linear programming to maximize the EMV traffic efficiency and find a trade-off between the interference with normal traffic flows and the smoothness of the EMV driving trajectories. Two customized algorithms are developed to reduce the number of decision variables and constraints to obtain the better feasible solution in an acceptable computational time. A numerical experiment based on real-world data is proposed to further verify the utility and effectiveness of the aforementioned mathematical model. The customized algorithms achieve near-exact solutions with significantly faster computation compared to the benchmark solver. The robustness of the proposed model is tested with different parameter settings in the sensitivity analysis.

In the above article[1],equation (1)on page 178 should appear as

Accurate transfer time prediction and future transfer time information are important for both public transport operators and passengers. However, existing studies cannot effectively manage high-dimensional transfer time data, capture the complex nonlinearity of transfer time, or provide accurate transfer time information. This study provides a reliable prediction model called low-rank Bayesian temporal matrix factorization (LBTMF) to address these challenges. First, on the basis of a high-dimensional spatiotemporal matrix of transfer time data, we develop a low-rank temporal-regularized matrix factorization-based imputation module to capture spatial and temporal characteristics to replace missing transfer time data. Second, to further predict the transfer time with the imputation of missing data, we propose the spatiotemporal-based Bayesian temporal matrix factorization prediction module to recover hourly and daily regular characteristics to predict the transfer time at different metro stations during various periods. Finally, the comprehensive experimental findings suggest that the LBTMF model outperforms other excellent approaches in terms of imputation efficiency, prediction accuracy, and robustness.

Oversaturation has become a serious issue for urban intersections worldwide due to the rapid increase in population and traffic demands. The emergence of connected and automated vehicle (CAV) technologies demonstrates the potential to improve oversaturated arterial traffic. Integrating vehicular control and intersection controller optimization into a single process based on CAV technologies can optimize the performance of mixed traffic flow scenarios with various levels of CAV market penetration. This paper proposes an efficient reservation-based cooperative ecodriving model (RCEM) for an isolated intersection under partial and complete CAV market penetration, which can simultaneously optimize the CAV trajectories and intersection controller. CAVs are utilized to precluster manual vehicles into a platoon to improve vehicle passage efficiency. Then, a heuristic-based algorithm is developed to effectively obtain an optimal solution. The proposed RCEM scheme is compared with fixed signal control and actuated signal control in a Simulation of Urban MObility (SUMO)-based platform. Experimental results prove that the RCEM scheme outperforms the fixed signal control and actuated signal control in terms of stop delay, fuel consumption, and emissions under the condition of low levels of CAV penetration. Sensitivity analysis indicates that the system performance further improves as the CAV penetration rate increases, and the stop delay is almost eliminated when the CAV market penetration reaches 100%. Furthermore, the vehicle delay fluctuation under left-turning rates ranging from 5%-75% is 4.4 sec, which is far better than the vehicle delay fluctuation of the fixed signal control (176 sec) and actuated control (65.6 sec).