Research on emergency truck dispatching scheme for the high speed railway freight interruption

Abstract

Subject to the risk of disruptions in high-speed rail (HSR) logistics networks caused by natural disasters or equipment failures, this study proposes an emergency scheduling optimization framework based on truck transshipment. By establishing a Mixed-Integer Linear Programming (MILP) model that integrates vehicle deployment point selection, route planning, and timeliness constraints, it achieves, for the first time, multi-level collaborative decision-making covering “vehicle deployment point selection - truck scheduling - goods transshipment” following an HSR logistics disruption. An Adaptive Large Neighborhood Search (ALNS) algorithm is designed, incorporating a dynamic strategy combining destroy operators (random/worst/Shaw/depot consolidation removal) and repair operators (greedy/regret-2/regret-3 insertion) to generate high-quality scheduling schemes. Using both the Zhengzhou-Qingdao Express Rail Line disruption case and multi-scale random instances, the model’s effectiveness is validated: ALNS achieves solution quality comparable to CPLEX with a maximum gap of only 0.037% while substantially reducing computation time, and significantly outperforms GA in both solution quality and efficiency.