既有繁忙干线基于货运产品的流量分配模型及算法研究  

Research on Model and Algorithm of Flow Assignment of Busy Truck Railway Lines based on Freight Products

作　　者：刘杰[1] 何世伟[1] 宋瑞[1] 李洁[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《铁道学报》2014年第7期1-7,共7页Journal of the China Railway Society

基　　金：国家重点基础研究发展计划(2012CB725403-4);国家自然科学基金(61374202);中国铁路总公司科技研究开发计划(2013X005-A;2013F021)

摘　　要：基于货运产品的流量分配是货运产品布局规划的核心技术,对分析铁路运输资源利用情况以及货运产品布局方案的调整具有重要意义。本文借鉴节点拆分思想,构建既有繁忙干线货运产品网络,结合需求特征将运输需求分类,采用改进的k短路算法确定OD对的可选径路集合,设计铁路既有繁忙干线基于货运产品的流量分配模型,利用改进的免疫克隆算法对模型求解,最后结合算例对模型及算法进行验证分析,结果表明模型和算法具有较好的适用性。Flow assignment based on freight products is the essence of optimized layout of railway freight products and is significant to analyze the utilizing situation of transportation resources and to optimize the programs of railway freight products.In this paper,the freight product network of existing busy truck railway lines was built by the method of nodes splitting.Then the transportation demand was classified.The improved k-shortest path of each OD was taken as the alternative path set.The flow assignment model of busy truck railway lines based on freight products was established.The immune clone algorithm was used to solve the model.A numerical example was given to verify the model and algorithm.The result shows that the model and algorithm are of good applicability.

关 键 词：既有繁忙干线 货运产品 节点拆分 免疫克隆算法 

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