检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《公路交通科技》2011年第1期100-106,共7页Journal of Highway and Transportation Research and Development
基 金:国家自然科学基金资助项目(50808064);天津市科技支撑计划重点项目(08ZCKFSF01100)
摘 要:研究时间依赖网络的城市紧急疏散交通线路问题。在对考虑疏散过程中交叉口延误和通行能力、紧急疏散网络防堵塞改造已有研究的基础上,对紧急疏散时城市交通网络的时变特性进行分析,提出了动态路阻交通紧急疏散线路的思想。考虑到紧急疏散时不一定满足FIFO要求的特性,将研究对象转化为时间依赖非FIFO网络交通紧急疏散线路的确定问题,建立了包括可变车辆行驶时间、交叉口延误和疏散等待时间在内的广义费用流最小化城市交通紧急疏散模型,采用最小费用流与时间依赖非FIFO网络最短路综合算法对模型进行优化求解,仿真试验结果证明了该思想方法的有效性。The problem of emergency evacuation routes of urban traffic in the time dependent network was studied.The time variant characteristic of urban traffic network was discussed based on the studies of emergency evacuation processes including intersection delay,traffic capacity,improving for preventing the blockage.The thought that to design the evacuation routes of urban traffic in dynamic road impedance network was proposed.Based on the non-first-in-first-out characteristic analysis of vehicles in emergency evacuation processes,the research object was transformed to determine the emergency evacuation routes in the time dependent non-first-in-first-out network.The model of emergency evacuation routes in urban traffic network was established to minimum generalized expense flow,which includes variable travel time,intersection delay and waiting time.The synthetic algorithm in the concrete optimization course was adopted for solution by using the successive shortest expense flow and the shortest path in the time dependent non-first-in-first-out network.The simulation result shows that the principle and the method are correct and feasible.
关 键 词:交通工程 紧急疏散线路 时间依赖网络 动态路阻 交叉口延误 最小费用流
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28