Train Scheduling in High-Speed Railway Freight Transportation Using a Hyper-Heuristic Algorithm

Abstract

The rapidly growing demand for high-quality logistics services, coupled with the expansion of high-speed rail networks, has presented both challenges and opportunities in the realm of high-speed rail freight transportation. Because of the intricacies of transportation logistics and the inherent complexities within passenger-train operations, addressing market demands proves to be challenging. This study focuses on optimizing passenger–freight collaboration within train timetables. Express cargo is typically transported either by incorporating it into planned passenger-train schedules or by introducing additional freight trains, both of which can disrupt the original passenger transport arrangements. To mitigate such disruptions, a buffer time is allocated to compensate for any disturbances, thereby transforming the delivery timeframe into a streamlined car-flow transit deadline. To address these challenges, we developed a passenger–freight collaboration optimization model for train timetables. This model was then solved using a bacterial foraging-based hyper-heuristic algorithm known for its global optimization capabilities and distribution-centric approach. In a comparison with existing studies and algorithms in transportation modeling, and considering parameters such as average fitness and running time, the proposed model and algorithm demonstrated superior efficiency.

Keywords

rail freight rail transportation freight passenger rail transportation high-speed

Get full access to this article

View all access options for this article.

References

Duan

Tavasszy

L. A.

Rezaie

Freight Service Network Design with Heterogeneous Preferences for Transport Time and Reliability. Transportation Research Part E: Logistics and Transportation Review, Vol. 124, 2019, pp. 1–12. https://doi.org/10.1016/j.tre.2019.02.008.

Wang

Zhang

Chen

Freight Train Service Design Problem with the Time Value of Shipper. Systems Engineering-Theory & Practice, Vol. 36, 2016, pp. 2328–2336. https://doi.org/10.12011/1000-6788(2016)09-2328-09.

Peiman

Kaveh

K. D.

A Robust Simulation-Optimization Approach for Pre-Disaster Multi-Period Location-Allocation-Inventory Planning. Mathematics and Computers in Simulation, Vol. 179, 2021, pp. 69–95. https://doi.org/10.1016/j.matcom.2020.07.022.

Jin

X.-M.

Zhou

X.-J.

Research on Optimization High-Speed Railway Freight Transportation Organization Scheme Based on Column Generation Algorithm. Journal of the China Railway Society, Vol. 42, 2020, pp. 26–32. https://doi.org/10.3969/j.issn.1001-8306.2020.09.004.

Ceric

Visual Interactive Modeling and Simulation as a Decision Support in Railway Transport Logistic Operations. Mathematics and Computers in Simulation, Vol. 44, 1997, pp. 251–261. https://doi.org/10.1016/S0378-4754(97)00055-4.

Yao

Zhang

Study on High-Speed Railway Quick Cargo Handling Study. Railway Science Engineering, Vol. 1, 2020, pp. 31–38. https://doi.org/10.19713/j.carolcarrollnki/u.T20190445.43-1423.

Zhang

Discussion on the Organization of High-Speed Rail Express Transportation. Railway Standard Design, Vol. 5, 2020, pp. 1–5. https://doi.org/10.13238/j.iSSN.1004-2954.201906220002.

Liu

Zhu

Yan

Liu

Express Freight Transportation Plan Optimization Based on Existed High Speed Railway Timetable. Journal of Wuhan University of Technology Transportation Science & Engineering, Vol. 40, 2016, pp. 1038–1042.

Xueqiao

Research on Optimization of High-Speed Freight Train Organization Scheme Based on Competitiveness Analysis. Beijing Jiaotong University, China, 2019.

10.

Shalaby

Roorda

Mao

Urban Rail Service Design for Collaborative Passenger and Freight Transport. Transportation Research Part E: Logistics and Transportation Review, Vol. 147, 2021, p. 102205. https://doi.org/10.1016/j.tre.2020.102205.

11.

Gao

Niu

Yang

Coordinating Train Timetable and Demand Assignment for Express Delivery with High-Speed Railway with Time-Dependent-Oriented Demand. Journal of Transport Information and Safety, Vol. 38, 2020, pp. 122–131. https://doi.org/10.3963/j.jssn.1674-4861.2020.04.015.

12.

Daily Dynamic Freight Train Service Optimization. Journal of Transportation Systems Engineering and Information Technology, Vol. 20, 2020, pp. 177–184. https://doi.org/10.16097/j.cnki.1009-6744.2020.05.026.

13.

Besinovic

Goverde

R. M. P.

Quaglietta

Roberti

An Integrated Micro–Macro Approach to Robust Railway Timetabling. Transportation Research Part B: Methodological, Vol. 87, 2016, pp. 14–35. https://doi.org/10.1016/j.trb.2016.02.004.

14.

Kroon

L. G.

Wagner

Gareats

Zaroliagis

Abstracts Collection – Algorithmic Methods for Railway Optimization. Proc., Algorithmic Methods for Railway Optimization, Dagstuhl Seminar Proceedings, Vol. 4261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2006, pp. 1–10. https://doi.org/10.4230/DagSemProc.04261.1.

15.

Liu

Z. H.

Cai

M. C.

Combinatorial Optimization Algorithms and Complexity, Tsinghua University Press, Beijing, 1988.

16.

Nemhauser

Wolsey

Integer and Combinatorial Optimization, 1st ed. Wiley Inc., Hoboken, NJ, 1988. https://doi.org/10.1002/9781118627372.

17.

Pardalos

P. M.

D. Z.

Graham

R. L.

, (eds.). Handbook of Combinatorial Optimization, Springer, New York, 2013. https://doi.org/10.1007/978-1-4419-7997-1.

18.

Lawler

E. L.

Wood

D. E.

Branch-and-Bound METHODS: A Survey. Operations Research, Vol. 14, 1966, pp. 699–719. https://doi.org/10.1287/opre.14.4.699.

19.

Vazirani

V. V.

Approximation Algorithms. Springer, Berlin, Heidelberg, 2013.

20.

Gutin

Yeo

The Greedy Algorithm for the Symmetric TSP. Algorithmic Operations Research, Vol. 2, 2007, pp. 33–36.

21.

Kumar

Singh

P. K.

Pareto Evolutionary Algorithm Hybridized with Local Search for Bi-Objective TSP. In Hybrid Evolutionary Algorithms ( Abraham

Grosan

Ishibuchi

, eds.), Studies in Computational Intelligence, Vol. 75, Springer Berlin, Heidelberg, 2007, pp. 361–398. https://doi.org/10.1007/978-3-540-73297-6_14.

22.

Hochba

D. S.

Approximation Algorithms for NP-Hard Problems. ACM SIGACT News, Vol. 28, 1997, pp. 40–52. https://doi.org/10.1145/261342.571216.

23.

Rezoug

Bader-El-Den

Boughaci

Guided Genetic Algorithm for the Multidimensional Knapsack Problem. Memetic Computing, Vol. 10, 2018, pp. 29–42. https://doi.org/10.1007/s12293-017-0232-7.

24.

Yang

Z. Z.

Yao

An Improved Ant Colony Optimization for Vehicle Routing Problem. European Journal of Operational Research, Vol. 196, 2009, pp. 171–176. https://doi.org/10.1016/j.ejor.2008.02.028.

25.

Z. W.

Yang

Y. J.

Sun

Y. X.

Zhang

C. J.

T. L.

An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem. Applied Mechanics and Materials, Vol. 26–28, 2010, pp. 620–624. https://doi.org/10.4028/www.scientific.net/AMM.26-28.620.

26.

Lin

Q. L.

Yang

Zhong

Parallel Simulated Annealing Algorithm Based on Particle Swarm Optimization Algorithm. Journal of Frontiers of Computer Science and Technology, Vol. 8, 2014, pp. 886–896. https://doi.org/10.3778/j.issn.1673-9418.1403052.

27.

Karimi-Mamaghan

Mohammadi

Meyer

Karimi-Mamaghan

A. M.

Talbi

E.-G.

Machine Learning at the Service of Meta- Heuristics for Solving Combinatorial Optimization Problems: A State-of-the-Art. European Journal of Operational Research, Vol. 296, No. 2021, pp. 393–748. https://doi.org/10.1016/j.ejor.2021.04.032.

28.

Wolpert

The Supervised Learning No-Free-Lunch Theorems. In Soft Computing and Industry: Recent Applications ( Roy

Köppen

Ovaska

Furuhashi

Hoffmann

, eds.), Springer, London, 2001, pp. 25–42. https://doi.org/10.1007/978-1-4471-0123-9_3.

29.

Y. C.

Pepyne

D. L.

Simple Explanation of the No-Free-Lunch Theorem and its Implications. Journal of Optimization Theory and Applications, Vol. 115, 2002, p. 549. https://doi.org/10.1023/A:1021251113462.

30.

Pan

J. S.

Zhang

Chu

S. C.

Zhang

S. Q.

J. M.

A Parallel Compact Marine Predators Algorithm Applied in Time Series Prediction of Backpropagation Neural Network (BNN) and Engineering Optimization. Mathematics and Computers in Simulation, Vol. 220, 2024, pp. 65–88. https://doi.org/10.1016/j.matcom.2024.01.012.

31.

Wang

Chen

Gao

Review of Reinforcement Learning for Combinatorial Optimization Problem. Journal of Frontiers of Computer Science and Technology, Vol. 16, 2022, pp. 261–279. https://doi.org/10.3778/j.issn.1673-9418.2107040.

32.

Scianna

The AddACO: A Bio-Inspired Modified Version of the Ant Colony Optimization Algorithm to Solve Travel Salesman Problems. Mathematics and Computers in Simulation, Vol. 218, 2024, pp. 357–382. https://doi.org/10.1016/j.matcom.2023.12.003.

33.

Sanchez

Cruz-Duarte

J. M.

Ortiz-Bayliss

J. C.

Ceballos

Terashima-Marin

Amaya

A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems. IEEE Access, Vol. 8, 2020, pp. 128068–128095. https://doi.org/10.1109/ACCESS.2020.3009318.

34.

Randall

Abramson

A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems. Computational Optimization and Applications, Vol. 20, 2001, pp. 185–210. https://doi.org/10.1023/A:1011211220465.

35.

Chakhlevitch

Cowling

Hyperheuristics: Recent Developments. In Adaptive and Multilevel Metaheuristics ( Cotta

Sevaux

Sörensen

, eds.), Springer, Berlin, Heidelberg, 2008, pp. 3–29.

36.

Tsai

C.-W.

Huang

W.-C.

Chiang

M.-H.

Chiang

M.-C.

Yang

C.-S.

A Hyper-Heuristic Scheduling Algorithm for Cloud. IEEE Transactions on Cloud Computing, Vol. 2, No. 2, 2014, pp. 236–250.

37.

Lin

Backtracking Search Based Hyper-Heuristic for the Flexible Job-Shop Scheduling Problem with Fuzzy Processing Time. Engineering Applications of Artificial Intelligence, Vol. 77, 2019, pp. 186–196.

38.

Behiri

Belmokhtar-Berraf

Chu

Urban Freight Transport Using Passenger Rail Network: Scientific Issues and Quantitative Analysis. Transportation Research Part E: Logistics and Transportation Review, Vol. 115, 2018, pp. 227–245. https://doi.org/10.1016/j.tre.2018.05.002.

39.

Anghinolfi

Paolucci

Sacone

Siri

Freight Transportation in Railway Networks with Automated Terminals: A Mathematical Model and MIP Heuristic Approaches. European Journal of Operational Research, Vol. 214, No. 3, 2011, pp. 588–594. https://doi.org/10.1016/j.ejor.2011.05.013.

40.

Rajni

Chana

Bacterial Foraging Based Hyper-Heuristic for Resource Scheduling in Grid Computing. Future Generation Computer Systems, Vol. 29, 2013, pp. 751–762. https://doi.org/10.1016/j.future.2012.09.005.

41.

Burdett

R. L.

Kozan

Techniques for Inserting Additional Trains into Existing Timetables. Transportation Research Part B: Methodological, Vol. 43, 2009, pp. 821–836. https://doi.org/10.1016/j.trb.2009.02.005.

42.

Xie

Gao

Gui

A New Neighbourhood Structure for Job Shop Scheduling Problems. International Journal of Production Research, Vol. 61, No. 7, 2022, pp. 2147–2161. https://doi.org/10.1080/00207543.2022.2060772.

43.

Passino

K. M.

Biomimicry of Bacterial Foraging for Distributed Optimization and Control. IEEE Control Systems Magazine, Vol. 22, 2002, pp. 52–67. https://doi.org/10.1109/MCS.2002.1004010.

44.

Liu

Passino

K. M.

Biomimicry of Social Foraging Bacteria for Distributed Optimization: Models, Principles and Emergent Behaviors. Journal of Optimization Theory and Applications, Vol. 115, 2002, pp. 603–628. https://doi.org/10.1023/A:1021207331209.

45.

Dasgupta

Das

Abraham

Biswas

Adaptive Computational Chemotaxis in Bacterial Foraging Optimization: An Analysis. IEEE Transactions on Evolutionary Computation, Vol. 13, 2009, pp. 919–941. https://doi.org/10.1109/TEVC.2009.2021982.

46.

Zhang

Yangbing

Zhang

Multitask-Oriented Manufacturing Service Composition in an Uncertain Environment Using a Hyper-Heuristic Algorithm. Journal of Manufacturing Systems, Vol. 60, 2021, pp. 138–151. https://doi.org/10.1016/j.jmsy.2021.05.012.

47.

Pre-Feasibility Study Report of Zhengzhou South High-Speed Rail Logistics Base. China Railway Fourth Survey and Design Institute Group Co., LTD., China, 2019. https://www.docin.com/p-2310763756.html.