Stochastic multi-objective optimization for dynamic timetable and track allocation at high-speed railway hubs

Train scheduling and track allocation are crucial for minimizing passenger flow conflicts, ensuring safety, and enhancing travel experience at railway hubs. This study presents a collaborative optimization model for railway hub operations, focusing on improving passenger transfer efficiency and minimizing arrival-departure track (ADT) utilization costs. A multi-objective hybrid model, referred to as COTADT, is developed to address spatiotemporal and stochastic constraints while balancing these two objectives. To solve this model efficiently, a customized augmented epsilon-constraint algorithm (CAEC) is introduced, utilizing augmented constraints and interval partitioning to generate Pareto-optimal solutions. The approach is validated with real-world data from the Hangzhou Hub, yielding significant improvements, including a 23.149% reduction in passenger transfer costs and a 7.101% reduction in ADT utilization costs. Comparative experiments demonstrate that CAEC outperforms heuristic algorithms in both solution quality and computational efficiency. This research provides a robust, scalable framework for enhancing operational performance and passenger experience at railway hubs.

Authors

Institutions

Publication Details

Journal
International Journal of Transportation Science and Technology
Published
2025-03-01
DOI
https://doi.org/10.1016/j.ijtst.2025.02.011
Citations
2
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stochastic multi-objective optimization for dynamic timetable and track allocation at high-speed railway hubs

Bing Yan, Siyuan Qu, Lu Huang, Wan Chen et al.
2 citations
International Journal of Transportation Science and Technology
Railway Systems and Energy Efficiency
2.48
article

Stochastic multi-objective optimization for dynamic timetable and track allocation at high-speed railway hubs

Bing Yan, Siyuan Qu, Lu Huang, Wan Chen, Xiaolei Zou, Xiaodong Fan
article en
2 citations

Abstract

Train scheduling and track allocation are crucial for minimizing passenger flow conflicts, ensuring safety, and enhancing travel experience at railway hubs. This study presents a collaborative optimization model for railway hub operations, focusing on improving passenger transfer efficiency and minimizing arrival-departure track (ADT) utilization costs. A multi-objective hybrid model, referred to as COTADT, is developed to address spatiotemporal and stochastic constraints while balancing these two objectives. To solve this model efficiently, a customized augmented epsilon-constraint algorithm (CAEC) is introduced, utilizing augmented constraints and interval partitioning to generate Pareto-optimal solutions. The approach is validated with real-world data from the Hangzhou Hub, yielding significant improvements, including a 23.149% reduction in passenger transfer costs and a 7.101% reduction in ADT utilization costs. Comparative experiments demonstrate that CAEC outperforms heuristic algorithms in both solution quality and computational efficiency. This research provides a robust, scalable framework for enhancing operational performance and passenger experience at railway hubs.

International Journal of Transportation Science and Technology
Tongji University (CN), Shanghai University of Engineering Science (CN), Shenzhen Metro (China) (CN), China Railway Shanghai Design Institute Group (China) (CN), Shanghai Urban Transportation Design Institute (China) (CN)
Openalex Percentile: Top 12%
Railway Systems and Energy Efficiency
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.