检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈雷[1] 林柏梁[1] 王龙[1] 温旭红[1] 李建[1]
出 处:《交通运输系统工程与信息》2015年第4期45-50,共6页Journal of Transportation Systems Engineering and Information Technology
基 金:中央高校基本科研业务费专项资金(2014YJS085);国家自然科学基金(51178031)
摘 要:在高速铁路初步成网、既有线运输能力得到不同程度释放的背景下,本文研究了铁路网最大货运发送量和流量分配的综合优化问题.文中以增长后的铁路网货运需求量来描述货运发送量,构建了符合铁路运输车流组织特点的多目标优化模型.模型的目标函数包括货运发送量的最大化和不同货运发送量情形下的流量分配成本最小化.同时考虑了单股货流增长量上限、车流走行具有树形径路特点、非重复径路的数学逻辑表达等约束条件.最后,基于相同算例数据对所构建模型及既有研究文献中的模型进行求解试验,分别得到两种模型下的铁路网最大货物发送量和流量分配方案,通过对比求解结果,验证了本文模型的有效性.Under the background of high speed railway network preliminary formation and the transportation capacity of existing railway lines are released in some level, this paper studies the integrated optimization of the maximum amount of railway freight transportation and flow distribution. In this paper, the growth of railway freight transportation demand is used to describe the maximum amount of railway freight transportation and a multi-objective model is built based on the characteristics of railway transportation organization. The objective contains the maximum amount of freight transportation and minimum flow distribution costs after the growth of transport demand. The upper limits of growth rate for each transportation demand, the tree-type feature of transportation routing and non repeated path constraint are considered in the model. Finally, a numerical case is designed to test the two models, one the model is built in this paper and the other is the model in existing research literature. The maximum amount of freight transportation and the flow distribution scheme are obtained respectively. The validity and feasibility of the proposed model are verified by comparing the computational results.
关 键 词:铁路运输 货运发送量 多目标优化 流量分配 树形径路
分 类 号:U292.32[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.105.128