检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京交通大学交通运输学院,北京100044 [2]铁道部办公厅,北京100844
出 处:《铁道学报》2007年第5期1-6,共6页Journal of the China Railway Society
摘 要:在周期运行的运输组织模式下,所有列车在车站到发都是周期循环发生的。将安排列车运行线的问题看作周期事件安排问题,并借助周期约束图及周期势差模型,可以建立周期运行图网络模型。模型充分考虑到列车不同情况下的停站时间、到发安全间隔等各项周期约束,并将列车的总停留时间最小作为目标函数。当约束图顶点和弧的数量众多时,模型的求解将比较困难。通过选择合适的约束图生成树,找到变量的合理取值范围,并对模型进行一些预先简化处理,可以降低模型的求解难度。最后求解一个区段不同列车开行方案的周期运行图,验证模型的可行性。In the periodic train diagram mode, arrivals and departures of all trains at stations occur periodically. Considering arranging train paths as arranging a periodic event, in virtue of the periodic constraint graph and the periodic tension model, the periodic train diagram network model is established. The model takes into full consideration the periodic constraints of trains such as the time of dwelling at stations under different cases and safe interval between train departure and arrival etc. and the model makes the minimum total station dwelling time as the objective function. In case there are multiple constraint graph vertexes and arcs, the solution of the model would be comparatively difficult to be found. Selecting the proper spanning tree of constraint graphs, finding the appropriate range of variables and simplifying the model in advance can facilitate easier solution. The periodic train diagrams of different train operation plans for one section is derived, which proves the feasibility of the model.
关 键 词:周期运行图 周期事件安排问题 约束图 网络模型 约束图生成树
分 类 号:U292.4[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175