从河床冲淤分析沉管法修建长江水下隧道问题

文章从三峡水库泥沙入库量的减少以及三峡水库对泥沙的拦截作用两个方面分析了三峡水库对长江中下游河床冲刷的影响,具体剖析了现有冲刷数值模拟的最大冲刷量远较实际冲刷量为小的原因,因此得出了在三峡以下长江中下游不宜采用沉管法修建长江水下隧道的结论。对于重庆地区朝天门两江隧道的修建方案问题,文章在分析了决定修建沉管隧道方案可行性的两个关键参数,即河床水深和水流流速后,指出只要采取相应工程措施,采用沉管法修建两江隧道是可行的。     

快速公交系统站台停靠时间模型研究

快速公交系统停靠站台停车延误是影响快速公交运行车速的关键因素之一,因此构建快速公交系统站台停靠时间模型是提升快速公交服务水平的基础理论研究。本文选取盐城BRT-1号线的起始站、中途站、客流离散站等三类站点为研究对象,综合运用数理统计法与数据挖掘法,构建快速公交系统站台停靠时间模型,并对该模型的合理性进行了检验。研究表明:盐城市BRT-1号线三类站台的快速公交车辆停靠时间与上下车乘客人数呈线性关系,即快速公交车辆停靠时间与上下车乘客人数的检验参数R2均大于0.8。     

Forecasting travel behavior using Markov Chains-based approaches

Recent advances in agent-based micro-simulation modeling have further highlighted the importance of a thorough full synthetic population procedure for guaranteeing the correct characterization of real-world populations and underlying travel demands. In this regard, we propose an integrated approach including Markov Chain Monte Carlo (MCMC) simulation and profiling-based methods to capture the behavioral complexity and the great heterogeneity of agents of the true population through representative micro-samples. The population synthesis method is capable of building the joint distribution of a given population with its corresponding marginal distributions using either full or partial conditional probabilities or both of them simultaneously. In particular, the estimation of socio-demographic or transport-related variables and the characterization of daily activity-travel patterns are included within the framework. The fully probabilistic structure based on Markov Chains characterizing this framework makes it innovative compared to standard activity-based models. Moreover, data stemming from the 2010 Belgian Household Daily Travel Survey (BELDAM) are used to calibrate the modeling framework. We illustrate that this framework effectively captures the behavioral heterogeneity of travelers. Furthermore, we demonstrate that the proposed framework is adequately adapted to meeting the demand for large-scale micro-simulation scenarios of transportation and urban systems.     

Short-term speed predictions exploiting big data on large urban road networks

Big data from floating cars supply a frequent, ubiquitous sampling of traffic conditions on the road network and provide great opportunities for enhanced short-term traffic predictions based on real-time information on the whole network. Two network-based machine learning models, a Bayesian network and a neural network, are formulated with a double star framework that reflects time and space correlation among traffic variables and because of its modular structure is suitable for an automatic implementation on large road networks. Among different mono-dimensional time-series models, a seasonal autoregressive moving average model (SARMA) is selected for comparison. The time-series model is also used in a hybrid modeling framework to provide the Bayesian network with an a priori estimation of the predicted speed, which is then corrected exploiting the information collected on other links. A large floating car data set on a sub-area of the road network of Rome is used for validation. To account for the variable accuracy of the speed estimated from floating car data, a new error indicator is introduced that relates accuracy of prediction to accuracy of measure. Validation results highlighted that the spatial architecture of the Bayesian network is advantageous in standard conditions, where a priori knowledge is more significant, while mono-dimensional time series revealed to be more valuable in the few cases of non-recurrent congestion conditions observed in the data set. The results obtained suggested introducing a supervisor framework that selects the most suitable prediction depending on the detected traffic regimes.     

横滩整治措施与效果分析

文章介绍了横滩整治工程的措施与效果,分析该滩获得成功整治的关键技术与经验,为类似工程提供参考。     

基于壅塞理论的CNG加气管流量计算分析

为了计算CNG加气系统的高压胶管的流量,以气体动力学为基础,建立等截面一维定常绝热摩擦流动的数学模型.利用VC+ +语言编制界面计算程序对模型进行编程求解,对壅塞状态和非壅塞状态下流量以及出口压力进行计算和拟合.当天然气汽车储瓶内的压力小于临界压力时,加气流量最大,且与胶管两端的压差无关,并计算出最大流量与胶管管长的关...     

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.     

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.