A dynamic multi-strategy algorithm for train headway optimization in intercity railways

This study develops a joint headway–dwell-time optimization framework for intercity railways, incorporating timetable-calibrated scenario demand, station-capacity constraints, and operating costs. Building on this model, SHDMS-ABC is developed using a closed-loop strategy scheduling mechanism jointly driven by success-history credit and population-state information. The algorithm adaptively coordinates multiple search operators and activates directed scout search under stagnation. For the Nanjing South–Taicang High-Speed Railway (NST-HSR), the optimized scheme maintains 57 daily services while reducing the morning-peak decision headway by 21.09%. Under an equal budget of 6,600 objective-function evaluations, SHDMS-ABC achieves the lowest mean objective value among eight competing algorithms across four tested scenarios. Across four supplementary railway-line scenarios, operating costs decrease by 17.00–33.33% and average train load factors increase by 11.28–16.87 percentage points, accompanied by longer waiting times. These results demonstrate competitive optimization performance and support the framework’s applicability under heterogeneous scenario-based operating conditions. The source code and experimental results are available at: https://github.com/Lutra11/SHDMS-ABC .

Authors

Institutions

Publication Details

Journal
Results in Engineering
Published
2026-11-18
DOI
https://doi.org/10.1016/j.rineng.2026.114137
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A dynamic multi-strategy algorithm for train headway optimization in intercity railways

Yaohui Zhong, B. Z. Li, Yong Lu
Results in Engineering
Railway Systems and Energy Efficiency
article

A dynamic multi-strategy algorithm for train headway optimization in intercity railways

Yaohui Zhong, B. Z. Li, Yong Lu
article en

Abstract

This study develops a joint headway–dwell-time optimization framework for intercity railways, incorporating timetable-calibrated scenario demand, station-capacity constraints, and operating costs. Building on this model, SHDMS-ABC is developed using a closed-loop strategy scheduling mechanism jointly driven by success-history credit and population-state information. The algorithm adaptively coordinates multiple search operators and activates directed scout search under stagnation. For the Nanjing South–Taicang High-Speed Railway (NST-HSR), the optimized scheme maintains 57 daily services while reducing the morning-peak decision headway by 21.09%. Under an equal budget of 6,600 objective-function evaluations, SHDMS-ABC achieves the lowest mean objective value among eight competing algorithms across four tested scenarios. Across four supplementary railway-line scenarios, operating costs decrease by 17.00–33.33% and average train load factors increase by 11.28–16.87 percentage points, accompanied by longer waiting times. These results demonstrate competitive optimization performance and support the framework’s applicability under heterogeneous scenario-based operating conditions. The source code and experimental results are available at: https://github.com/Lutra11/SHDMS-ABC .

Results in EngineeringVol. 32
Minzu University of China (CN), Xi'an University of Architecture and Technology (CN), Modern Electron (United States) (US)
National Natural Science Foundation of China
Industry, innovation and infrastructure, Sustainable cities and communities
Railway Systems and Energy Efficiency
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.

Laika access coming soon