检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘诗序[1] 陈文思[1] 阎昊[1] 关宏志[2]
机构地区:[1]福州大学土木工程学院,福州350116 [2]北京工业大学建筑工程学院,北京100124
出 处:《交通运输系统工程与信息》2017年第3期127-135,共9页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金项目(51308126;51378036;51308018)~~
摘 要:假设出行者出发时间与路径选择随历史出行信息的更新而不断调整,研究网络交通流逐日动态演化规律.考虑出行者有限理性,基于累积前景理论,建立了出行者出发时间选择、时间间隔权重更新、路径选择及路径行程时间分布更新模型.通过数值实验表明:出行者对历史理解行程时间依赖程度对每个出发时段的稳定的流量分布无显著影响,但是对路径流量演化有显著影响;当出行者对历史理解行程时间的依赖程度大于等于0.90时,考虑出发时间选择的路网流量演化最终能达到稳定状态;从系统的整体效率来看,当出行者对历史理解行程时间的依赖程度在[0.90,0.95]时,有限理性下的交通分配结果优于完全理性.It is assumed that travelers adjust departure time and route choices according to updating historical information. With considering traveler's bounded rationality, the day-to-day dynamic models of network traffic flow are developed based on the cumulative prospect theory. The proposed models reveal how travelers make departure time and route choices, update the time interval weight, and the route travel time distribution function. Numerical experiments on a grid network show that the reliance on historical perceived travel time have no significant effect on the stable flow distribution of each departure time interval,but have significant effect on network traffic flow evolution. When the reliance on historical perceived travel time is greater than or equal to 0.90, the network traffic flow considering departure time choice will eventually reach a steady state. From the perspective of the overall efficiency of the network system, when the reliance on historical perceived travel time is within [0.90, 0.95], the boundedly rational traffic assignment will be better than the perfectly rational one.
关 键 词:交通工程 有限理性 累积前景理论 网络交通流 路径选择 出发时间
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.195.228