摘要
为了寻求勾画机车交路的算法，主要讨论在运行线位置给定的条件下，如何把机车交路问题转化为最小费用最大流网络模型的方法。
In order to find out the algorithm for optimizing the locomotive working diagram,the paper discusses the method to convert the problem of locomotive working diagram into a network model with the minimum fare and the maximum flow under the condition in which the train schedule has been given.This method is more practicable for making the locomotive working diagram by the application of computer.
出处
《铁道学报》
EI
CSCD
北大核心
1996年第5期9-13,共5页
Journal of the China Railway Society
