计算机编制网状线路列车运行图方法研究  

Network Hierarchy Parallel Algorithm of Automatic Train Scheduling

作　　者：周磊山[1] 胡思继[1] 马建军[1] 乐逸祥[1] 

机构地区：[1]北方交通大学

出　　处：《铁道学报》1998年第5期15-21,共7页Journal of the China Railway Society

基　　金：铁道部科技发展计划项目

摘　　要：设计了网状线路条件和多条列车径路条件下列车运行时刻表规划的网络分层并行算法。该方法首先提出了路网结构的分层节点表示法和列车时刻表的序列事件表示法。是将列车事件序列按车站和区间进行归并分组，提出一种统一布点、按列车优先级分层、按各区间端点列车事件的状态，并行触发区间列车事件状态转移算法来计算列车运行时刻表的方法。Under the conditions of railway netted lines and various types of train running routes ,this paper designs an algorithm named the network hierarchy parallel algorithm of train scheduling. This algorithm first presents the representation of hierarchy nodes of railway network structure and the representation of sequence events of train timetable, and divides the train sequence events into groups according to station and section.Then a new method is presented to calculate the train timetable which initializes the timetable integrally, grades the train sequence events by train priority, and triggers parallelly the algorithm to shift the section events' state according to the state of the station train events on the endpoint. This paper also presents networked and distributed calculation method to work out the large scale train timetable.

关 键 词：网状线路 列车运行时刻表 列车运行图 计算机 

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