检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学交通运输工程学院,湖南长沙410000
出 处:《铁道科学与工程学报》2016年第7期1414-1419,共6页Journal of Railway Science and Engineering
基 金:中央高校基本科研业务费专项资金资助项目(2015zzts207)
摘 要:基于布雷斯悖论现象,根据城市交通网络中路段或路段组合对路网通行效率的影响,可将其划分为低效的或必要的,合理关闭路网中的低效路段及路段组合将减少所有出行者的出行时间成本,必要路段及路段组合的关闭将增加出行者额外的出行延误。采用改进的自适应遗传算法以有效地定位大规模真实交通网络中的低效路段组合,结合美国旧金山市大规模实际交通网络地理信息系统(GIS)数据以及该区居民通勤出行数据进行实证分析。研究结果证实低效路段和必要路段的组合可能是低效的。分析表明,低效路段组合的低效程度|ΔTS|随着所含路段数量增加呈现先增后减的变化趋势,含路段数相对少的低效路段组合对路网效率产生更大的影响也更普遍。In this paper, road and cluster of roads in transportation network were classified as inefficient or necessaryaccording to their effect on the efficiency of the road network, based on Braess^s paradox. Reasonable closureof inefficient links can reduce travel costs considerably, while the failure of necessary links would result inextra travel delays. We modified the adaptive genetic algorithm to pinpoint inefficient road clusters in a real large-scale traffic network. Actual transportation network data from geographical information systems (GIS) and dailycommuting origin destination matrix in the San Francisco were used. Our empirical results show that inefficientroad clusters include not only inefficient road but also necessary road. Meanwhile, the degree of inefficiency IA T S I increases first and then decreases as the number of roads in the road clusters increase. Inefficient road clusterscontain less road with large IZiT5l , which is much more common as well.
关 键 词:城市交通效率 布雷斯悖论 大规模交通网络 自适应遗传算法
分 类 号:U491.13[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28