基于自适应神经模糊推理的交通状态判别方法

文章针对交通状态具有模糊性和主观性的特点,建立能够真实反映人对交通拥塞程度感觉的自适应-神经模糊推理系统,使具有变化连续的交通流参数模糊化处理,实现了道路交通状态的准确、快速辨别。     

Urban form,travel time,and cost relationships with tour complexity and mode choice

The primary purpose of this study was to investigate how relative associations between travel time, costs, and land use patterns where people live and work impact modal choice and trip chaining patterns in the Central Puget Sound (Seattle) region. By using a tour-based modeling framework and highly detailed land use and travel data, this study attempts to add detail on the specific land use changes necessary to address different types of travel, and to develop a comparative framework by which the relative impact of travel time and urban form changes can be assessed. A discrete choice modeling framework adjusted for demographic factors and assessed the relative effect of travel time, costs, and urban form on mode choice and trip chaining characteristics for the three tour types. The tour based modeling approach increased the ability to understand the relative contribution of urban form, time, and costs in explaining mode choice and tour complexity for home and work related travel. Urban form at residential and employment locations, and travel time and cost were significant predictors of travel choice. Travel time was the strongest predictor of mode choice while urban form the strongest predictor of the number of stops within a tour. Results show that reductions in highway travel time are associated with less transit use and walking. Land use patterns where respondents work predicted mode choice for mid day and journey to work travel.

Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: Design,demonstration and validation

Estimation/updating of Origin–Destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources.     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

山区高速公路隧道典型安全因素分析及其对策研究

文章针对西部多条山区高速公路隧道运营安全情况,分析山区高速公路隧道的典型安全事故及原因,提出了基于车速限制、车道限制、照明控制与交通安全设施的安全对策,为山区高速公路隧道的安全运营提供参考。     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

Increasing the capacity of signalized intersections with separate left turn phases

A separate turn phase is often used on the approach leg to an intersections with heavy left turns. This wastes capacity on the approach because some of its lanes cannot discharge during its green phases. The paper shows that the problem can be eliminated by reorganizing traffic on all the lanes upstream of an intersection using a mid-block pre-signal. If drivers behave deterministically, the capacity that can be achieved is the same as if there were no left turns. However, if the reorganization is too drastic, it may be counterintuitive to drivers. This can be remedied by reorganizing traffic on just some of the available lanes. It is shown that such partial reorganization still increases capacity significantly, even if drivers behave randomly and only one lane is reorganized. The paper shows how to optimize the design of a pre-signal system for a generic intersection. It also identifies both, the potential benefits of the proposed system for a broad class of intersections, and the domain of application where the benefits are most significant.     

A shockwave profile model for traffic flow on congested urban arterials

In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.     

Compromising system and user interests in shelter location and evacuation planning

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness.     

Fine-grained OD estimation with automated zoning and sparsity regularisation

Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.