基于服务网络动态配流的直达列车开行方案优化编制方法  

Optimal Planning Method for Operation Plan of Through Train Based on Dynamic Traffic Assignment of Service Network

作　　者：唐金金[1] 杨露萍[2] 周磊山[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044 [2]中国铁道科学研究院运输及经济研究所,北京100081

出　　处：《中国铁道科学》2016年第4期115-120,共6页China Railway Science

基　　金：交通运输部建设科技项目(2015318223010)

摘　　要：将编组站视为服务网络的节点,编组站间可开行的直达去向视为节点间的有向弧(方案弧),并将该直达去向车流的集结时间和旅行时间之和作为方案弧的旅行费用;将服务网络节点进一步分解成入流节点和出流节点,由此区分车站的始发、终到和通过车流;在入流节点与出流节点之间构造1条有向弧(解体弧)供通过车流解体使用,并将车流的解体时间作为解体弧的旅行费用;从而将直达列车开行方案转化为服务网络。以全服务网络车流总旅行费用最小为目标函数,构建服务网络动态配流优化模型。基于动态配流算法求解模型,实现服务网络车流量的平衡。此时服务网络中有车流量的方案弧表示对应编组站间应开行直达列车,从而得到优化直达列车开行方案。以某地区铁路网络为例,验证了方法的可行性和有效性。Regarding the marshalling stations as nodes in the service network,the nonstop train line plans between marshalling stations as directed arcs（line plan arcs）.The traveling cost on each arc is set to be the sum of car flow accumulation time and traveling time of the nonstop train block.Nodes in the service network are further divided into＂in-flow＂and＂out-flow＂nodes so that the departure,arrival and passing train flows of a station are distinguished.A directed arc（breakup arc）is constructed from the in-flow node to the out-flow node,which is used for the breakup of passing train flow,with the car breakup time served as the traveling cost.Then the operation plan for direct train is transformed into a service network.The service network dynamic flow assignment optimization model is constructed in which the objective function aims to minimize the total traveling cost of the car flow in the service network.The model is solved based on the dynamic flow assignment algorithm in order to realize the car flow balance of service network.The line plan arcs with feasible car flow denote direct train line plans between corresponding marshalling stations and then the optimized direct train operation plans are obtained.Taking the railway network in a certain area as an example,the feasibility and effectiveness of the proposed approach is verified.

关 键 词：直达列车开行方案 编组站 优化编制 服务网络 动态配流 

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