Development of a driving cycle for Colombo,Sri Lanka: an economical approach for developing countries

Financial constraints and lack of availability of traffic‐related information significantly hinder the development of driving cycles in developing countries. This paper proposes an economical, practical, accurate methodology for the development of driving cycles, including the development of a driving cycle for Colombo, Sri Lanka. The proposed methodology captures regional traffic and road conditions and selects a model that represents the collected data sample with minimum available traffic‐related information. Existing methods were modified for route selection by dividing routes into links using nodes or physical junctions to minimize the number of trips required for data collection. Speed–time data for respective links were used to reconstruct speed–time profiles of identified origin–destination pairs. The on‐board method was used for data collection, and the Markov chain theory was used to develop a transition probability matrix of state changes. An additional matrix was introduced to the existing method to improve model representativeness to the collected data sample. Copyright © 2016 John Wiley & Sons, Ltd.     

水平定向钻数据采集及远程监控系统研究

文中针对油气长输管道水平定向钻施工,研发了数据采集及远程监控系统。通过数据采集装置将钻机施工中的关键数据进行实时采集、处理和远程无线传输,由手机APP进行远程监控,实现了工程项目的远程管理,预测后续施工中可能出现的问题,降低施工风险,提高施工效率。     

Mining missing train logs from Smart Card data

This paper shows how to recover the arrival times of trains from the gate times of metro passengers from Smart Card data. Such technique is essential when a log, the set of records indicating the actual arrival and departure time of each bus or train at each station and also a critical component in reliability analysis of a transportation system, is missing partially or entirely. The procedure reconstructs each train as a sequence of the earliest exit times, called S-epochs, among its alighting passengers at each stations. The procedure first constructs a set of passengers, also known as reference passengers, whose routing choices are easily identifiable. The procedure then computes, from the exit times of the reference passengers, a set of tentative S-epochs based on a detection measure whose validity relies on an extreme-value characteristic of the platform-to-gate movement of alighting passengers. The tentative S-epochs are then finalized to be a true one, or rejected, based on their consistencies with bounds and/or interpolation from prescribed S-epochs of adjacent trains and stations. Tested on 12 daily sets of trains, with varying degrees of missing logs, from three entire metro lines, the method restored the arrival times of 95% of trains within the error of 24 s even when 100% of logs was missing. The mining procedure can also be applied to trains operating under special strategies such as short-turning and skip-stop. The recovered log seems precise enough for the current reliability analysis performed by the city of Seoul.     

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.     

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.     

Flow-based accessibility measurement: The Place Rank approach

In this paper, we empirically test the viability of a flow-based approach as an alternative to transport accessibility measurement. To track where commuters travel from and to (but not commute times), we use transactional smartcard data from residents in Singapore to construct the (daily) spatial network of trips generated. We use the Place Rank method to demonstrate the viability of the flow-based approach to study accessibility. We compute the Place Rank of each of 44 planning areas in Singapore. Interestingly, even though the spatial network is constructed using only origin–destination information, we find that the travel time of the trips out of each planning area generally decreases as the area’s Place Rank increases. The same is also the case for in-vehicle time, number of transfers in the network and transfer time. This shows that a flow-based approach can be used to measure the notion of accessibility, which is traditionally assessed using travel time information in the system. We also compare Place Rank with other indicators, namely, bus stop density, eigenvector centrality, clustering coefficient and typographical coefficient to evaluate an area’s accessibility. The results show that these indicators are not as effective as the Place Rank method.     

Design and evaluation of an integrated inventory and transportation system

This paper proposes the adoption of an integrated inventory and transportation system (IITS) to minimize the total costs of inventory and transportation. A non-linear programing is developed by analyzing transportation and inventory costs with one supplier and many retailers in the distribution environment. The paper compares the proposed model with the traditional approach in computing total costs with numerical data. The results indicate that the total costs can be optimized by adopting integrated programing rather than the traditional approach, along with achieving improved customer service levels. In particular, sensitivity analysis is applied to determine the performance of the IITS under various transportation costs, holding costs and shortage costs. It shows that the transportation cost per unit is most sensitive in the proposed model. In this situation, the IITS is more effective for cost saving when set-up cost, holding and shortage costs are high, but is less effective for situations involving high per-unit transportation costs.     

Estimating traffic volumes for signalized intersections using connected vehicle data

Recently connected vehicle (CV) technology has received significant attention thanks to active pilot deployments supported by the US Department of Transportation (USDOT). At signalized intersections, CVs may serve as mobile sensors, providing opportunities of reducing dependencies on conventional vehicle detectors for signal operation. However, most of the existing studies mainly focus on scenarios that penetration rates of CVs reach certain level, e.g., 25%, which may not be feasible in the near future. How to utilize data from a small number of CVs to improve traffic signal operation remains an open question. In this work, we develop an approach to estimate traffic volume, a key input to many signal optimization algorithms, using GPS trajectory data from CV or navigation devices under low market penetration rates. To estimate traffic volumes, we model vehicle arrivals at signalized intersections as a time-dependent Poisson process, which can account for signal coordination. The estimation problem is formulated as a maximum likelihood problem given multiple observed trajectories from CVs approaching to the intersection. An expectation maximization (EM) procedure is derived to solve the estimation problem. Two case studies were conducted to validate our estimation algorithm. One uses the CV data from the Safety Pilot Model Deployment (SPMD) project, in which around 2800 CVs were deployed in the City of Ann Arbor, MI. The other uses vehicle trajectory data from users of a commercial navigation service in China. Mean absolute percentage error (MAPE) of the estimation is found to be 9–12%, based on benchmark data manually collected and data from loop detectors. Considering the existing scale of CV deployments, the proposed approach could be of significant help to traffic management agencies for evaluating and operating traffic signals, paving the way of using CVs for detector-free signal operation in the future.     

Japanese perspective of driver information systems

A perspective view of of Japanese R&D activities of Driver Information Systems is given from the standpoint of developing joint projects by public and private sectors. First, a brief history of the R&D activities is illustrated from above mentioned standpoint. Then, two major projects, AMTICS and RACS, and the social backgrounds of these projects are explained. In order to give a clear idea of both projects some technical details are treated.Based on the history and the present status of the developments, the basic design conceptions of Japanese Driver Information Systems are explained and several factors or reasons which have influenced to the design conception are discussed. Then, the promoting systems of the R&D activities are generally explained and present status of the projects and future problems in developing more advanced systems are also handled. A brief discussion on the establishment of international standard is also mentioned as a final comment.