Theoretical and Natural Science

- The Open Access Proceedings Series for Conferences


Theoretical and Natural Science

Vol. 39, 21 June 2024


Open Access | Article

Train dispatching program for high-speed railway station based on genetic algorithm

Haozhe Li * 1
1 Tongji University

* Author to whom correspondence should be addressed.

Theoretical and Natural Science, Vol. 39, 76-85
Published 21 June 2024. © 2023 The Author(s). Published by EWA Publishing
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Citation Haozhe Li. Train dispatching program for high-speed railway station based on genetic algorithm. TNS (2024) Vol. 39: 76-85. DOI: 10.54254/2753-8818/39/20240601.

Abstract

In case of train delays, centralized traffic control system become disabled, and the workload of dispatchers increases dramatically. Based on genetic algorithm, the author designs a program to appropriately reschedule trains in terms of delays, minimizing the total delay time and changes of gate. The author transformed the initial problem to a compromised combinatorial optimization model, with total delay time, changes of gate and conflicting routes as objectives. The high weighting in conflicting routes ensures efficiency and high probability of obtaining a feasible solution. With discreate variants, the author designs special coding and evolving method suitable for this problem. Using a special treatment for conflicts and initializing chromosomes, the program can construct new timetable quickly given the scheduled timetable, predicted arrival time and order of trains (optional), which promotes the efficiency and security of dispatching in high-speed railway stations. The method was tested with a synthetic data of Shanghai-Kunming section of Hangzhou East Railway Station.

Keywords

Train dispatching, genetic algorithm, optimization

References

1. Zwaneveld P J, et al. 1996 Routing Trains Through Railway Stations: Model Formulation and Algorithms. Transportation Science, 30(1), 181-194.

2. Zwaneveld P J, Kroon L G and Hoesel S R M 2001 Routing Trains Through a Railway Station Based on a Node Packing Model. European Journal of Operational Research, 128(1), 14-33.

3. Liu L, Wang N and Du W 2002 Research on Network Optimization Model and Algorithm for Throat Passing Capacity of Stations. Journal of Railways, 1-5.

4. Zhou Z L, You B and Li X T 2002 A model and algorithm for the occupancy arrangement of switch groups in the throat area of railway technical stations. Journal of Sichuan Institute of Technology, 70-72.

5. Shi F, Chen Y, Qin J and Zhou W L 2009 Comprehensive optimization of the application of arrival and departure lines and the arrangement of arrival and departure routes in railway passenger stations. China Railway Science, 108-113.

6. Li Y H 2007 Research on Immune Evolution Algorithm for Railway Station Route Selection. Beijing Jiaotong University.

7. Long J C, Gao Z Y, Ma J J and Li K P 2007 Research on Optimization Model and Solution Algorithm for Railway Station Route Selection. Journal of Railways, 7-14.

8. Chen Y 2010 Optimization of Train Passing Path and Adjustment Operation at Passenger Stations. Changsha: Central South University.

9. Li Y H 2010 Research on Optimization Scheme for the Operation of Arrivals and Departures at Large Passenger Stations during Peak Hours. Beijing Jiaotong University.

10. Xia M, Zhou L S, Le Y X, Zhou Y F and Zhou Y 2010 Research on Random Chance Constraint Model and Algorithm for the Application of Arrival and Departure Lines in Passenger Dedicated Stations. Logistics Technology, 8, 54-58.

Data Availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Authors who publish this series agree to the following terms:

1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.

2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.

3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open Access Instruction).

Volume Title
Proceedings of the 2nd International Conference on Mathematical Physics and Computational Simulation
ISBN (Print)
978-1-83558-463-7
ISBN (Online)
978-1-83558-464-4
Published Date
21 June 2024
Series
Theoretical and Natural Science
ISSN (Print)
2753-8818
ISSN (Online)
2753-8826
DOI
10.54254/2753-8818/39/20240601
Copyright
21 June 2024
Open Access
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Copyright © 2023 EWA Publishing. Unless Otherwise Stated