Search

With the traffic congestion problem deteriorating, people increasingly choose urban rail transit (URT) to travel. Although URT alleviates traffic congestion, the long-term operation of a large number of trains leads to huge energy consumption. In order to adapt the major social development concept of "Low carbon", a multi-train energy-saving control collaborative optimization method is proposed in this paper. First, the composition of single train operating conditions is determined by the conversion of operating conditions between stations and the force changes under the premise of ensuring safe and on-time train operation. A single-train energy consumption calculation combinatorial optimization model with the dual control objectives of reducing passengers' average waiting time as well as train traction energy consumption is established. The energy saving control strategy of a single train is investigated by ARMA-Radial Basis Function Neural Network (ARMA-RBFNN) and Genetic Algorithm (GA). Next, the queuing theory is introduced to analyze the variation in passenger waiting time for multiple trains at different arrival intervals. A Deep Reinforcement Learning (DRL) algorithm is designed to obtain the correlation among passenger waiting time, arrival interval and train stopping time. The optimization objective is to minimize the multi-train traction energy consumption and the average passenger waiting time while considering conditions such as train operating safety interval, speed limit, multiple operating state and single train energy-saving models, etc. Then, a multi-train cooperative energy-saving control model is proposed based on the Dragonfly Algorithm (DA). Finally, a case study of Beijing Metro Line 4 is conducted to illustrate the effectiveness of the proposed method. The results demonstrate that the total traction energy consumption and passenger waiting time are reduced by 3.1% and 5 s, respectively, compared with the method of independently optimizing the single-train control strategy. The findings can aid in the development of energy-saving strategies and also provide a basis for energy-saving operation control of multiple trains. [ABSTRACT FROM AUTHOR]

Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%). [ABSTRACT FROM AUTHOR]

• A reliable path finding model is proposed to minimize the fuel consumption budget. • Specified on-time arrival probability index is ensured by reliable path finding model. • A heuristic label setting algorithm is developed to exactly solve the formulated problem. • Real traffic data is applied for the applicability and efficiency verification. Transport activities are regarded as a major source of fuel consumption and CO 2 emission production. To reduce the negative impact of traffic-related CO 2 emission, this paper proposes a reliable path-finding algorithm for improving fuel efficiency in stochastic networks under the uncertainty of travel time and fuel consumption with the consideration of spatial correlation. A reliable constrained path-finding model is developed and formulated to minimize the fuel consumption budget while guaranteeing the specified on-time arrival probability. A heuristic label setting algorithm is developed to precisely solve the formulated problem. The proposed algorithm overcomes the time-consuming drawbacks of traditional path enumeration algorithms. The applicability and efficiency of the proposed algorithm are verified on real-world traffic data acquired from the Beijing and Xi'an networks in China. The experiments demonstrate that our proposed algorithm can significantly reduce fuel consumption compared to existing studies. The experiment in Beijing shows that using the proposed algorithm can reduce 0.9 kg of CO 2 emissions on average per trip compared to existing studies. [ABSTRACT FROM AUTHOR]