检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王龙[1] 马建军 林柏梁[1] 倪少权[3] 吕红霞[3]
机构地区:[1]北京交通大学交通运输学院,北京100044 [2]中国铁路总公司信息办,北京100844 [3]西南交通大学交通运输与物流学院,成都610031
出 处:《交通运输系统工程与信息》2013年第5期127-133,144,共8页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金(51178031);铁道部科技研究开发计划项目(2012X012-B)
摘 要:从网络流与组合优化的观点研究路网装车地直达列车编组计划、技术直达(直通)编组计划及区段管内列车开行计划的综合优化问题,以最原始站点间OD车流为基础,通过分析始发车流与技术车流相容和转化的条件,实现装车地与技术站列车编组计划的整合,同时摒弃了相邻支点间必然存在区段列车去向这一不尽合理的假设条件,抓住摘挂车流与区段车流的运行特点,深入剖析开行区段列车的利弊性,从而构建了装车地直达、技术直达及区段列车编组计划的综合优化模型.最后,结合数值算例,获得相对车小时消耗最少的车流组织优化方案,并通过对比分析,验证了将区段列车开行条件纳入列车编组计划综合优化的合理性和必要性.With the theory of network flows and combinatorial optimization, this paper focuses on the integrated optimization of the direct train services from loading area, from technical yards and within local sections. On a basis of the primitive OD shipment between each two nodes in the network, the paper integrates the train formation plans from loading area and technical yards considering the condition of compatibility and transformation between originated flows and technical flows. An assumption is not adopted in this study, there is a district train service between each two adjacent technical yards. The paper also analyzes the merits and drawbacks of running district trains with consideration of the pick-up flows anddistrict flows. It then develops the model for synthetically optimizing the direct train services from loading area, technical yards and within local sections. Finally, a numerical example is presented and the optimal blocking plan is designed, which is for the least relative car-hour consumption. This example validates the rationality and necessity of adding running district trains to the optimal train formation plan.
关 键 词:铁路运输 列车编组计划 LINGO 车流 直达列车 区段列车 摘挂列车
分 类 号:U292.3[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.80.241