检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡剑鹏 罗霞[1,2] Hu Jianpeng;Luo Xia(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Southwest Jiaotong University,Chengdu 611756,China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都611756 [2]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都611756
出 处:《系统仿真学报》2022年第3期512-526,共15页Journal of System Simulation
基 金:四川省科技厅科技计划(2020YJ0255)。
摘 要:根据轨道交通网络存在大量换乘路径的特点,改进深度优先搜索算法得出站点间换乘路径的有效出行时间。基于自动票务收集系统(automatic fare collection system,AFC)数据得到的乘客进出闸机时刻,利用仿真方法确定乘客与列车在时间和路径的接续关系,同时考虑始发乘客和换乘乘客路径选择行为的差异,将二者区分配流。动态更新先到乘客利用换乘路径的出行时间,并以更新后的时间作为后续出发乘客的路径选择依据。结果表明,该仿真方法可以有效反映乘客的出行过程,具有较高的配流精度。Based on the characteristics of a large number of transfer routes in rail transit network,an improved depth first search algorithm is proposed to get the effective travel time of transfer routes between stations.Based on passenger entry and exit timing obtained from the automatic fare collection(AFC)data,the connect relationship between passengers and trains in time and route is obtained from the arrival time and route selection behavior of passengers.Considering the difference of route choice behavior between departure passenger and transfer passenger,the two are distinguished from each other.The dynamically updated travel time of the arrived passengers using the transfer path is fed back to the subsequent departure passengersas the basis for the subsequent passenger path selection.The results show that the simulation method can effectively reflect the travel process of passengers and has a high accuracy of passenger allocation.
关 键 词:轨道交通 动态客流分配 时刻表 自动票务收集系统(automatic fare collection system AFC)数据
分 类 号:U231[交通运输工程—道路与铁道工程] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38