检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李得伟[1] 韩宝明[2] 李晓娟[1] 张洪军[3]
机构地区:[1]北京交通大学交通运输学院,北京100044 [2]北京交通大学轨道交通控制与安全国家重点实验室,北京100044 [3]沈阳铁路局客运处,辽宁沈阳110001
出 处:《铁道学报》2013年第6期1-5,共5页Journal of the China Railway Society
基 金:国家自然科学基金(61004105);国家科技支撑计划(2009BAG12A10);中央高校基本科研业务费专项基金(2011JBM159)
摘 要:合理的列车停站方案对高速铁路运输计划的制定具有重要的现实意义,既有停站方案的编制受到各种技术与政策因素的影响,一般采用人工方法反复调整确定。本文提出一种基于节点服务的高速铁路列车停站方案优化模型,该模型的特点是将不确定性和不易量化的因素统一用节点服务表示,以方案总停站次数最少为目标,将节点服务频率、站间服务可达性、单个列车停站次数等作为主要约束条件,构建带有叉乘约束的非线性规划模型。运用停站概率与计算机模拟结合的方法有效解决了模型求解的问题。通过模型灵敏度分析发现,单个列车停站次数约束是影响停站方案求解可行性的关键问题。最后,以国内某高速铁路为例,进行实践应用,表明模型具有较好的可用性。Rational stopping schedules are of practical significance in formulating high-speed railway operation plans. Conventional stopping schedules are usually fixed through repeated manual adjustments and this is due to the influence of various technique and policy factors. In this paper,the high-speed railway stopping schedule op- timization model was put forward, which was based on node services. Referring to the features of the model,the uncertain and not easy to be quantified factors were turned to be described as node services, to minimize the to- tal number of stopping was set as the target of the model and the node service frequency, inter-station service accessibility and number of one-train stopping were made the main constraints of the model. The model was a non-linear planning model with the cross-product constraint. The model was solved by combining stopping probability with computer simulation. Through model sensitivity analysis, it was found that the number of onetrain stopping is the key issue to influence the feasibility of stopping schedules. The model was applied on a high speed railway line in China for case studyThe model is proved to possess good usability.
分 类 号:U293.1[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30