Abstract: In recent years, railway incidents occur frequently and seriously affect the normal operation of the railway. So reasonable emergency resource scheduling is an effective way to improve the railway emergency rescue capabilities and reduce the damages caused by emergencies. Based on game theory, the paper takes the emergency point as game players, constructs the resource dynamic demand function and depicts the system loss by the time accumulated for the emergency point of the resources loss, which is considering the factors such as rescue and emergency capacity constraints and the important degree of different resources in different emergency point. Describing multi-emergency points resource scheduling as a multi-stage non-cooperative games process, regarding the minimum system total losses as the target, this paper establishes a dynamic multi-stage resource scheduling model of multi-emergency-multi-rescue-variety resources, designs an improved cuckoo search algorithm to solve Nash equilibrium of the model and gets the optimal railway emergency resource scheduling scheme. It verifies the model’s feasibility and the superiority of the algorithm through concrete examples. The results show that this model is relatively close to actual and has a better applicability and the improved cuckoo search algorithm is more efficient that can provide the basis and support for railway emergency resource scheduling decision.

Key words: railway emergency resource scheduling, game theory, dynamic demand, multi-stage scheduling model, Nash equilibrium, improved cuckoo search algorithm

摘要： 近年来，铁路突发事件时有发生，严重影响铁路的正常运营，合理地进行应急资源的调度是提高铁路整体应急救援能力，减少突发事件所造成损失的有效途径。以博弈论为理论基础，将各应急点看作博弈局中人，考虑救援点到应急点的运力限制以及不同资源在不同应急点的重要度等因素，构建了资源动态需求函数，并用应急点对资源缺少量的时间累积来刻画系统损失。将多应急点的资源调度描述为一个多阶段非合作博弈过程，以系统总损失最小为目标，建立多应急点—多救援点—多种资源的动态多阶段资源调度模型，并设计了求解该模型Nash均衡的改进布谷鸟算法，从而得到最优的铁路应急资源调度方案。通过具体算例验证了模型的可行性与算法的优越性。结果表明该模型较为切近实际、适用性较强且改进后的算法更具高效性，可为铁路应急资源调度决策提供依据和支持。

关键词: 铁路应急资源调度, 博弈理论, 动态需求, 多阶段调度模型, Nash均衡, 改进布谷鸟搜索算法