This paper carried on the theoretical analysis of the single directional,single pushing and single humping wagon-flow allocation model,with the shortest car dwell time at stations as the objective.The transformation theorem of three optimization objectives under the model was proved by mathematical proof,and the eight deductions were obtained under different hypothesis conditions.In order to verify the validity of the heuristic rules of above theorems and deductions,they were designed as priority rules of selecting train breakingup and the wagon-flow plans in each stage.The reasoning algorithm of multistage wagon-flow allocation target was used,which took the maximum number of departure trains as sub-objective.The experimental results showed the efficient approximate solution of the algorithm in linear time complexity.%以所有车辆在站停留时间最短为目标,对单向单推单溜配流模型进行理论分析,证明该模型下的三个优化目标转换定理,并在不同假设条件下得出8个推论.为了验证上述定理和推论的启发效果,将它们设计为各阶段选择解体列车和编制配流方案的优先规则,并构建以每列出发列车获得最大车流数最多为子目标的多阶段配流问题推理算法,实例结果表明该算法可在线性时间复杂度内获得高效近似解.
展开▼
