Open AccessMethod for optimizing the allocation of the following car schedule based on minimum running time
Author(s) -
WU Xing-yu
Publication year - 2020
Publication title -
iop conference series. earth and environmental science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.179
H-Index - 26
eISSN - 1755-1307
pISSN - 1755-1315
DOI - 10.1088/1755-1315/587/1/012075
Subject(s) - schedule , train , energy consumption , computer science , redundancy (engineering) , arrival time , energy (signal processing) , running time , real time computing , mathematical optimization , engineering , transport engineering , algorithm , mathematics , statistics , cartography , electrical engineering , geography , operating system
Rail transit has become one of the most important means of transportation in various countries, which brings huge energy consumption. This paper studies how to allocate the running time of trains between multiple stations to adjust the schedule, to achieve the purpose of energy-saving. Before time allocation between multiple stations, there must be an optimal operation strategy for single-station trains. Studies have shown that under the optimal operation strategy, the longer the time, the smaller the energy consumption, and the remaining redundant time is allocated based on the minimum time. The train operation schedule can reduce energy consumption. In the first phase of this paper, the minimum running time between stations is modeled and solved. Based on this, the existing optimal operation strategy is used to obtain the time and energy consumption relationship curve. In the second phase, the operation redundancy is allocated based on the train energy consumption time relationship model. In terms of time, the optimized energy-saving schedule is obtained to achieve the purpose of energy-saving train.