铁路路网系统运输能力的新算法研究  

Study on a Novel Algorithm for Railway Network System Carrying Capacity Calculation

作　　者：郑亚晶[1] 张星臣[1] 

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

出　　处：《物流技术》2011年第11期65-68,74,共5页Logistics Technology

基　　金：自然科学基金项目"铁路危险货物运输安全过程控制关键技术研究"(60776835)

摘　　要：从系统理论和运输需求的概念出发,分析了国内外铁路路网运输能力的研究成果。从OD流矩阵的角度提出了铁路路网系统运输能力的概念,在此基础上构建了铁路路网系统运输能力的双层规划计算模型,该模型已最大化OD流矩阵乘数从为上层规划模型的目标,以最小化广义运输费用为下层模型目标,并提供了基于Lingo软件和Double-sweep算法的实用解法。最后,以一个铁路路网为例,用模型进行了求解,得出了路网最大能力及实现此最大能力的车流径路,并指出了进一步研究的方向。After reviewing literatures of studies conducted in and outside of China on the carrying capacity of railway networks, the paper proposes the concept of railway network system carrying capacity from the angle of OD matrix and formulates a bi-layer model for its planning and computation. This model takes the maximization of the multiplier of the OD matrix as its upper layer objective and the minimization of the general transport cost as the lower layer objective and develops a practical algorithm based on the software Lingo and the Double-sweep algorithm. Finally, in the case of a railway network, it applies and solve the model, obtains its maximum system carrying capacity and the concomitant train routing, and points out the direction for further researches.

关 键 词：铁路路网 运输能力 OD流矩阵 

分 类 号：F530.86[经济管理—产业经济]