石方边坡控制爆破在公路路网工程中的运用

文章通过光面爆破与普通石方爆破的对比,总结石灰岩地区光面爆破各技术参数的选取和施工工艺的控制方法。     

齐齐哈尔市中心城区电动汽车及充电设施需求预测研究

在目前能源危机和环境保护的双重制约下,发展电动汽车已经成为解决能源环境问题的新途径。为适应未来电动汽车快速发展的需要及充电设施的合理规划布局,电动汽车及充电设施的需求预测就显得尤为重要。文中分析了影响齐齐哈尔市电动汽车发展规模的影响因素,结合国内其他省市的经验,考虑齐齐哈尔市实际情况,对齐齐哈尔市中心城区的电动汽车和充电设施发展规模进行了合理预测。     

Differences in single heavy vehicle crashes at intersections and midblocks

The objective of this research is to identify the factors differentiating between single heavy vehicle collisions at intersections and midblocks by using a binary logit model. Our results show that single vehicle crashes involving heavy vehicle at intersections are more likely to occur on main roads and highways, whereas crashes at midblocks are more likely to occur on divided two‐way roads, roads with special facilities or features (e.g. bridge) and roads with a higher percentage of heavy vehicle traffic. Intersection crashes are also more likely to involve vehicles that are turning left or right, resulting in angle crashes and vehicle overturn, whereas midblock crashes are more likely to involve vehicles on higher posted speed roads. Copyright © 2017 John Wiley & Sons, Ltd.     

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.     

Validating and improving public transport origin–destination estimation algorithm using smart card fare data

Smart card data are increasingly used for transit network planning, passengers’ behaviour analysis and network demand forecasting. Public transport origin–destination (O–D) estimation is a significant product of processing smart card data. In recent years, various O–D estimation methods using the trip-chaining approach have attracted much attention from both researchers and practitioners. However, the validity of these estimation methods has not been extensively investigated. This is mainly because these datasets usually lack data about passengers’ alighting, as passengers are often required to tap their smart cards only when boarding a public transport service. Thus, this paper has two main objectives. First, the paper reports on the implementation and validation of the existing O–D estimation method using the unique smart card dataset of the South-East Queensland public transport network which includes data on both boarding stops and alighting stops. Second, the paper improves the O–D estimation algorithm and empirically examines these improvements, relying on this unique dataset. The evaluation of the last destination assumption of the trip-chaining method shows a significant negative impact on the matching results of the differences between actual boarding/alighting times and the public transport schedules. The proposed changes to the algorithm improve the average distance between the actual and estimated alighting stops, as this distance is reduced from 806 m using the original algorithm to 530 m after applying the suggested improvements.     

空气罐控制输液管道水击研究

采用特征线法对瞬时关闭管道终端阀门 ,在安装和不安装空气罐两种状况时 ,管道压力的变化情况进行了数值模拟 ,并分析了空气罐初始容积、空气罐安装位置等参数对管道瞬态水击压力变化的影响 ,结果表明 :在输液管道的适当位置安装容积一定的空气罐能较好地控制水击的产生     

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.     

管道内防腐层补口技术研究进展

管道内衬或内防腐涂层现场施焊时,焊缝两侧的防腐层会由于高温作用而破坏,使环焊缝处不能得到有效的保护,内补口技术也成为影响管道质量的主要瓶颈。文中介绍了国内外主要的内补口技术,如内补口机法、内衬保护套（管）焊接法、不锈钢接头法、机械连接法等,并指出各方法的特点。文中还就内补口技术的质量控制和研究方向等提出了建议。     

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.     

Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.