Answers are grounded in this paper and cite their sources.
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 .
No takes yet. Share an insight, caveat, or question.
Lu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: