Scheduling and Evaluation of a Power-Concentrated EMU on a Conventional Intercity Railway Based on the Minimum Connection Time
Open Access
- 3 February 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (3) , 508
Abstract
Power-concentrated EMU trains have the advantages of being fast and comfortable, having a flexible formation and a short turn-back time, and so on. They can effectively release the transportation capacity of tense lines and hubs (the replacement of conventional trains with power-concentrated EMUs can reduce the time it takes to enter and exit locomotive yards by 40 min per train), optimize operating structures, improve the quality and efficiency of passenger products for conventional railways, and enhance the travel experience of passengers. Moreover, they have certain cost advantages and practical operational value for improving the market competitiveness of conventional railways. In this study, a two-stage, two-layer cycle method is adopted to solve the application plan of an EMU with the minimum total connection time. Through the decomposition of optimization objectives, the search space and the solution scale in each stage are reduced. In the first stage, the feasible number of routes and the number division plan of internal running lines are listed. In the second stage, an improved ant colony algorithm is designed to arrange and combine the internal running lines in each plan to improve the search quality and convergence speed, which changes the pheromone volatilization coefficient with iteration. The optimal number of routes, the number of internal routes, and the optimal sequence between routes are obtained. The study also puts forward a method of route division according to the passenger load factor, which can help railway bureaus adjust the capacity according to fluctuations in demand. A running diagram of six pairs of power-concentrated EMUs on an intercity railway is used as the background to solve the problem. The optimal connection plan with 14 groups of different route division plans was evaluated by using the entropy weight–TOPSIS method, and the optimal plan was obtained in the form of a route division method with two groups of routes with three pairs of trains in each group. Compared with the actual operation plan, the number of routes and the number of first-level repairs are reduced by 50%, respectively, which can effectively reduce the operation and maintenance costs of EMUs. Compared with the actual plan, the average operation mileage is increased by 100%, the average mileage loss is decreased by 54.6%, and the minimum distance traveled by EMUs is increased by 200%, which indicates that the mileage maintenance cycle of the actual operation plan is not fully used. The average number of tasks of EMUs is increased by 100%, indicating that the efficiency of EMUs in the actual operation plan needs to be improved. The traffic mileage balance is improved by 100%, indicating that the EMUs in different routes are more balanced.Keywords
Funding Information
- Science and Technology Research and Development Program of China, National Railway Group Co., LTD. (J2024X009)
This publication has 18 references indexed in Scilit:
- A flow formulation for the rolling stock maintenance scheduling problemIFAC-PapersOnLine, 2024
- A rolling horizon for rolling stock maintenance scheduling problem with cyclical activitiesComputers & Industrial Engineering, 2024
- Formulation of train routing selection problem for different real-time traffic management objectivesJournal of Rail Transport Planning & Management, 2024
- Approximating rolling stock rotations with integrated predictive maintenanceJournal of Rail Transport Planning & Management, 2024
- New Exact Algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demandEuropean Journal of Operational Research, 2024
- Dynamic fleet maintenance management model applied to rolling stockReliability Engineering & System Safety, 2023
- An integrated model for high-speed rolling-stock planning and maintenance schedulingEngineering Optimization, 2023
- A Variable Neighborhood Search heuristic for rolling stock reschedulingEURO Journal on Transportation and Logistics, 2021
- A comparison of two exact methods for passenger railway rolling stock (re)schedulingTransportation Research Part E: Logistics and Transportation Review, 2016
- A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway☆Omega, 2009