检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白广争[1] 郭进[1] 石红国[2] 杨扬[1] 王秀玄
机构地区:[1]西南交通大学信息科学与技术学院,成都611756 [2]西南交通大学交通运输与物流学院,成都611756
出 处:《交通运输系统工程与信息》2015年第1期191-197,共7页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金(U1334201);中国铁路总公司重大课题(2013X012-A-1;2013X012-A-2;2014X008-A)
摘 要:研究了高峰时段列车运行的衔接协调对换乘站候车客流量的优化问题.首先分析了换乘站各站台候车客流的组成因素,确定出各运行方向的换乘站台内客流量随时间变化的规律.然后,以时段内换乘站候车客流量的最大值最小为目标,建立优化模型.模型以站台最大可容纳候车人数为约束条件,以各方向列车在换乘站的到达时刻为调整对象,实现了高峰时段换乘站内聚集客流的优化.最后,针对验证案例,设计了遗传算法进行求解,得出了协调较优解,并给出与较劣解的对比分析.结果表明,该优化方法能够有效降低换乘站内的候车客流人数,可为网络化的优化协调工作提供参考.Optimization for the number of waiting passengers in transfer station by coordinating trains' arriving time in the rush hour is studied. Firstly, it analyzes each factor which had influence on the passengers in each platform, and obtains formulas to describe the variation of waiting passengers with time in each direction. Secondly, it establishes the optimization model which minimizes the maximum of total waiting passengers during the study period. The model takes the site capacity as constraints, and takes trains' arrival time in each direction in transfer station as adjustment object. Finally, the model is validated by an example, and genetic algorithm is designed to search the optimal solutions. It also obtains some worse solutions for contrast. By contrast, the optimal solutions can effectively reduce the number of waiting passengers in transfer station. The study can provide a reference for network coordination.
分 类 号:U292.41[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42