计算机编制不成对机车周转图的研究  

Working out of Non Pair Locomotive Working Diagrams with a Computer

作　　者：吕红霞[1] 杨明伦[1] 毛节铭 

机构地区：[1]西南交通大学运输工程系

出　　处：《西南交通大学学报》1998年第4期378-382,共5页Journal of Southwest Jiaotong University

摘　　要：针对不成对列车运行图机车周转图的编制，综合考虑了最优性和均衡性的要求，提出一种新算法，该算法综合运用匈牙利法和最小费用最大流法，使问题的解满足实用要求。实际应用表明，该算法能够有效地解决不成对机车周转图的编制问题。Based on systematic consideration of optimization and balance, a new algorithm is proposed to work out locomotive working diagrams scheduled for non pair trains with a computer. This algorithm makes use of both Hungary algorithm and minimum cost and maximum flow algorithm to satisfy the practical requirements. Its application to Jiexiu Linfen section shows its effectiveness for laying out non pair locomotive working diagrams.

关 键 词：铁路 机车周转图 网络模型 列车运行图 计算机 

分 类 号：U292.41[交通运输工程—交通运输规划与管理]