以所有车辆在站停留时间最短为目标,对单向单推单溜配流模型进行理论分析,证明该模型下的三个优化目标转换定理,并在不同假设条件下得出8个推论。为了验证上述定理和推论的启发效果,将它们设计为各阶段选择解体列车和编制配流方案的优先规则,并构建以每列出发列车获得最大车流数最多为子目标的多阶段配流问题推理算法,实例结果表明该算法可在线性时间复杂度内获得高效近似解。 Taking the shortest residence time of all the vehicles as the goal, the theoretical analysis of the one-way single-push-slip model is carried out. The theorem of the three optimization objectives under the model is proved and eight inferences are made under different assumptions. In order to validate the heuristic effects of the above theorems and inferences, we design them as the priority rules for selecting disassembly trains and planning the distribution schemes in each stage, and construct a multi-stage distribution problem reasoning algorithm with the maximum number of vehicles per departure train as the sub-target Experimental results show that this algorithm can obtain high efficient approximate solution in linear time complexity.