维修时间不确定的列车车底调度问题研究

Study on Train Set Assignment with Uncertain Maintenance Time

将我国铁路网看成是由多个中心车站组成的网络,对含有一个中心车站的辐射状铁路网的单种类型列车车底调用问题,建立相应的确定性模型,并且证明先到先发算法为该问题的最优算法。在此基础上,考虑检修时间不确定的列车车底调度问题,给出先到先发原则下该随机问题需要列车车底数量的期望值的求解方法。最后,通过实际算例验证模型的有效性。

Chinese railway network can be considered as a special network which consists of several central stations. On the issue of train set assignment in domestic railway network of China, a mathematical model is established focusing on a radial network with single central station, and the First-In-First-Out （FIFO） algorithm is proved as optimum method. On this basis, the train set assignment with uncertain maintenance time is considered, and the solving method on expectation value of train set number is provided for stochastic problem under FIFO algorithm. In the end, the validity of the model is proved through actual example.