检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白广争[1] 郭进[1] 石红国[2] 杨扬[1] 张太花
机构地区:[1]西南交通大学信息科学与技术学院,成都610031 [2]西南交通大学交通运输与物流学院,成都610031
出 处:《交通运输系统工程与信息》2013年第5期134-139,201,共7页Journal of Transportation Systems Engineering and Information Technology
基 金:中央高校基本科研业务费专项资金资助(SWJTU11CX44);铁道部科技研究开发计划项目(2012X010-A)
摘 要:通过协调城市轨道交通网络中换乘站各方向列车的离站时刻,实现减小旅客的换乘等待时间.分析了多条线路以不同形式相交情况下换乘站列车的到发接续关系,得出换乘接续方向总数的计算公式.在此基础上,以协调时段内各个换乘接续方向上所有换乘旅客总等待时间最少为目标建立了模型.结合丢弃法,设计针对模型的简单遗传算法(SGA).最后,以两线路相交为例做模型验证,并根据设计的算法求解,得出部分优化解.计算结果表明,文中模型能有效减少旅客换乘等待时间.本研究可为网络化运行条件下列车开行方案的制定及优化调整提供支持.By coordinating the trains' departure time in the transfer station, optimized scheme is proposed to reduce the waiting time of transfer passengers in the transfer station of the urban traffic network. The transfer relationship between two trains in different lines which intersect with different forms in a transfer station is analyzed, and the formulas are derived to describe these connecting relationships. Based on the analysis, a model which minimizes the total waiting time of all transfer passengers during the coordinating period is established. Simple genetic algorithm (SGA) with the discard method is designed to solve this problem. Finally, an example with two lines' intersection is given to verify the model and partial optimized solutions are obtained by using the proposed algorithm. The results show that the model can reduce transfer passengers' waiting time. This study can provide some theoretical reference for the design and optimization of the train operation scheme under the urban traffic network operating scenario.
关 键 词:城市交通 换乘衔接优化 简单遗传算法 换乘站 协调模型
分 类 号:U292.41[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222