摘要
本文基于给定路网环境参数、车流量以及车流径路，并考虑接续车流的影响，参考服务系统选址λ－增量法算法的思维方式，对路网上列车编组计划问题进行分析，建立一变量数规模为（ｎ３－ｎ）的寻找有利编组去向的数学模型。根据模型自身的特点，设计出相应的网络流算法，同时剖析了该算法的若干特性，并举例演示计算。
In this paper, considering the current state of the railway network, we analyse the problem of train formation plan and give a mathematical model, in which the variables size is n 3-n , to look for beneficial directions by regarding the Optimum Location of Service Systems as reference. According to characteristics of the model, we give an effective network flow algorithm, and dissect several quality about algorithm, and take a computation as example.
出处
《铁道学报》
EI
CAS
CSCD
北大核心
1998年第2期12-19,共8页
Journal of the China Railway Society
