Formal scientific research of traffic collision data utilizing GIS

This paper explores the tenuous link between speeding behavior and accident causation, one that has not been well established in the international literature to date. Taking advantage of established engineering conventions and formulae, we were able to set up an a priori hypothesis suitable for testing. Utilizing this formal scientific method (which GIS researchers have been criticised for not using) we establish a statistical link for this relationship. Our methodology can be used to support all police intervention strategies, including the controversial photo radar systems. The results from our research have been entered into a GIS in order to create a map for spatial display. This map illustrates the relative probability or risk of collision occurrence resulting from speeding at all intersections and interchanges within the scope of the study. It is suggested that this methodology could easily be maintained with periodic updates of data, thus creating a dynamic model from which to monitor traffic safety within the city. Furthermore, this model can be utilized to study specific strategies, allowing for the scrutiny of before, during and after effects. The study area is the entire city of Calgary, Alberta, Canada, and includes all traffic collisions occurring during the year of 1994.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.     

水中悬浮隧道交通荷载模拟方法研究

为研究水中悬浮隧道交通荷载的合理模拟方法以及交通荷载对隧道结构的影响,借鉴铁路、公路交通荷载的模拟方法,综合考虑车辆轮载、路面不平度、行车速度以及外部激励荷载等影响因素的共同作用,提出水中悬浮隧道交通荷载的模拟表达式。通过数值模拟计算,分析悬浮隧道交通荷载的变化特征,并研究不同交通荷载模拟方法对悬浮隧道结构振动位移响应的影响。结果表明:文章提出的交通荷载模拟方法计算结果符合移动振动荷载的波动性和周期性特征。在对结构振动位移响应影响方面,固定均布荷载相当于静载,移动集中荷载和移动振动荷载时的位移变化幅值相对固定均布荷载时的大且影响相似,但移动振动荷载时的振幅稍大,体现了交通荷载中动荷载部分对结构振动位移响应的影响,更适合用来模拟悬浮隧道中的交通荷载。     

信息化战争交通重点目标防护的对策

针对信息化战争条件下战场透明化和打击精确化的特点,从建立和完善"综合集成" 的防护体系、完善伪装防护技术手段、适时做好交通保障器材的储备和更新等方面,提出了交通重点目标防护应采取的技术措施和应对精确打击的相关对策.     

城市灯控平面交叉口的自行车交通设计研究

城市灯控平面交叉口混合交通流安全和效率的核心研究对象应该是自行车与机动车交通流间的相互影响。本丈在大量的理论分析和实践的基础上,探讨时空分离法的自行车交通设计的基本原则和交通空间设计方法,即自行车右转弯专用车道设计、左转自行车二次过街以及自行车与行人过街一体化设计,并进行了南京市太平北路与珠江路交叉口的应用实例分析。本文的城市灯控平面交叉口自行车的交通设计方法可为解决城市灯控平面交叉口混合交通问题提供借鉴。     

大型活动交通影响评价方法

大型活动吸引和产生的突增交通量会造成周边地区的交通拥挤。通过比较大型活动与大型商业建设项目的交通影响评价特点和分析大型活动交通管理的影响因素,分别针对“提供一次性服务的大型活动”和“提供长效服务的大型活动”,设计了交通需求的预测方法。以交叉口服务水平分析方法为基础,提出一种了大型活动的交通影响评价方法。以长春市南岭体育场举办的“中国足球甲A联赛”为对象,运用Vissim微观交通仿真软件对所提出的方法进行了初步验证。结果表明,在大型活动条件下,所提出的方法能够确定需要进行交通管制的空间范围。     

行人微观仿真中的运动模型与行为模型——STEPS与NOMAD模型对比

为了解各类行人仿真模型的性能差异和适用范围,以选取适当模型进行交通枢纽行人仿真,对两种典型行人仿真模型进行研究。依据模型对行人行为描述的复杂程度,将行人仿真模型分为运动模型、部分行为模型、行为模型3类,并分别介绍了各自的特点。选取典型的运动模型软件STEPS和行为模型软件NOMAD,详细探讨其采用的数学模型,并通过4个仿真实例对比分析这两种模型的特点。分析结果得出两种模型在宏观与微观层面的异同点以及存在的问题。     

公交通行能力约束的智能调度优化模型

公交通行能力是解决城市交通拥堵问题、促进城市公共交通系统高效运行的要素之一。介绍了公交通行能力的计算要素,并针对目前我国城市由于盲目调度造成的公交系统运营效率、服务水平下降的问题,提出将公交通行能力作为约束条件对公交调度进行优化。鉴于公交企业制订调度方案时需兼顾公交服务水平和企业效益,将智能调度的目标确定为候车时间满意度、候车空间满意度、车内舒适满意度和企业满意度加权平均值最大,并给出了相应的计算方法。最后讨论了利用遗传算法对模型进行求解的过程。     

短时交通流预测方法比较

短时交通流预测是实现交通流诱导的关键技术之一。短时交通流因为其不确定性等特点而使其预测很复杂。通过实地调查获取的交通流量数据,分别采用移动平均法、指数平滑法、AR模型法3种交通流预测方法进行短时交通流量预测,并通过不同的评价指标对上述3种方法的预测效果进行评价,得出AR模型方法的预测效果优于其他2种方法。