检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵军[1] 李愈[1,2] 任其亮[3] 彭其渊[1]
机构地区:[1]西南交通大学交通运输学院,四川成都610031 [2]西南交通大学峨眉校区,四川峨眉山614202 [3]重庆交通大学交通运输学院,重庆400074
出 处:《西南交通大学学报》2011年第1期148-153,共6页Journal of Southwest Jiaotong University
基 金:国家自然科学基金资助项目(60776827)
摘 要:为了合理分配引入高速和城际客运专线的铁路枢纽内客运站的接发旅客列车任务,以始发终到客流在各客运站之间的分配、始发终到和通过客流的运行路径为决策变量,以最小化枢纽内始发终到和通过旅客的费用为目标,以客运站始发终到能力和通过能力、铁路线路旅客列车通过能力、旅客运输需求为约束条件,建立了客运站分工多目标非线性混合整数规划模型.考虑铁路枢纽内运行路径少的特点,设计了基于枚举法、多最短路和线性规划的精确求解算法.算例表明,该方法能够对3个客运站的接发旅客列车数量进行定量分配,始发终到能力占用率分别为100%、64.5%和69.3%,通过能力占用率分别为78.7%、65.9%和25%.To optimally allocate arrival and departure passenger trains among passenger stations in a railway terminal that connects high-speed and intercity passenger railway lines,a multiple-objective nonlinear mixed integer programming model was proposed.In the model,decision variables include distribution of arrival and departure passenger flows,and routes of arrival,departure and through passenger flows;constraints are the carrying capacity of stations and railway lines,and demand of passenger transportation;and objectives are the costs of all passengers in the terminal.An exact algorithm was designed by combining enumeration method,multiple shortest algorithm and linear programming in consideration of that a railway terminal connects a few routes.An example demonstrates that the proposed method could quantitatively solve the problem of optimally allocating arrival and departure passenger trains among 3 passenger stations in a railway terminal.
分 类 号:U291.6[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15