摘要
通过对动车组周转内在特性的分析,结合国内外对动车组的研究现状,提出了构造二部图,采用匈牙利算法求解出动车组周转二部图的最小权最大匹配,简单快速地实现了计算机自动编制图定的成对列车运行图的车底运用计划,并求出所需最少需要动车组数.
Based on the analysis of the dynamic train-set circulation and research in this field, we construct an equinoctial diagram and, adopting Hungary Algorithm, find the minimum expense and maximum matching of the circulation of Dynamic Train-Set. The method is simple and quick to work out the Train-Set schedule of the given geminating train schedule diagram with computer. And the needful number of Train-Set by using this method is the minimum.
出处
《西南民族大学学报（自然科学版）》
CAS
2005年第5期779-782,共4页
Journal of Southwest Minzu University(Natural Science Edition)
关键词
高速铁路
动车组周转
二部图
匈牙利算法
high-speed railway
train-set scheduling
equinoctial diagram
Hungary algorithm
