Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.     

A modified reinforcement learning algorithm for solving coordinated signalized networks

This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of link flows. For this purpose, MOdified REinforcement Learning algorithm with TRANSYT-7F (MORELTRANS) model is proposed by way of combining RL algorithm and TRANSYT-7F. The modified RL differs from other RL algorithms since it takes advantage of the best solution obtained from the previous learning episode by generating a sub-environment at each learning episode as the same size of original environment. On the other hand, TRANSYT-7F traffic model is used in order to determine network performance index, namely disutility index. Numerical application is conducted on medium sized coordinated signalized road network. Results indicated that the MORELTRANS produced slightly better results than the GA in signal timing optimization in terms of objective function value while it outperformed than the HC. In order to show the capability of the proposed model for heavy demand condition, two cases in which link flows are increased by 20% and 50% with respect to the base case are considered. It is found that the MORELTRANS is able to reach good solutions for signal timing optimization even if demand became increased.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

Predicting the adoption of connected autonomous vehicles: A new approach based on the theory of diffusion of innovations

On the grounds that individuals heavily rely on the information that they receive from their peers when evaluating adoption of a radical innovation, this paper proposes a new approach to forecast long-term adoption of connected autonomous vehicles (CAVs). The concept of resistance is employed to explain why individuals typically tend to defer the adoption of an innovation. We assume that there exists a social network among individuals through which they communicate based on certain frequencies. In addition, individuals can be subject to media advertisement based on certain frequencies. An individual’s perceptions are dynamic and change over time as the individual is exposed to advertisement and communicates with satisfied and dissatisfied adopters. We also explicitly allow willingness-to-pay (WTP) to change as a result of peer-to-peer communication. An individual decides to adopt when (i) there is a need for a new vehicles; (ii) his/her WTP is greater than CAV price; and (iii) his/her overall impression about CAVs reaches a cutoff value. Applicability of the proposed approach is shown using a survey of employees of the University of Memphis. Our results show that the automobile fleet will be near homogenous in about 2050 only if CAV prices decrease at an annual rate of 15% or 20%. We find that a 6-month pre-introduction marketing campaign may have no significant impact on adoption trend. Marketing is shown to ignite CAV diffusion but its effect is capped. CAV market share will be close to 100% only if all adopters are satisfied with their purchases; therefore, the probability that an individual becomes a satisfied adopter plays an important role in the trend of adoption. The effect of the latter probability is more pronounced as time goes by and is also more prominent when CAV price reduces at greater rates. Some caveats may be inserted when considering the study results as the findings are subject to sample bias and data limitations.     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.     

System energy optimisation strategies for metros with regeneration

Energy and environmental sustainability in transportation are becoming ever more important. In Europe, the transportation sector is responsible for about 30% of the final end use of energy. Electrified railway systems play an important role in contributing to the reduction of energy usage and CO₂ emissions compared with other transport modes. For metro-transit systems with frequently motoring and braking trains, the effective use of regenerated braking energy is a significant way to reduce the net energy consumption. Although eco-driving strategies have been studied for some time, a comprehensive understanding of how regeneration affects the overall system energy consumption has not been developed. This paper proposes a multi-train traction power network modelling method to determine the system energy flow of the railway system with regenerating braking trains. The initial results show that minimising traction energy use is not the same as minimising the system energy usage in a metro system. An integrated optimisation method is proposed to solve the system energy-saving problem, which takes train movement and electrical power flow into consideration. The results of a study of the Beijing Yizhuang metro line indicate that optimised operation could reduce the energy consumption at the substations by nearly 38.6% compared to that used with the existing ATO operation.     

Large-scale dynamic transportation network simulation: A space-time-event parallel computing approach

This paper describes a computationally efficient parallel-computing framework for mesoscopic transportation simulation on large-scale networks. By introducing an overall data structure for mesoscopic dynamic transportation simulation, we discuss a set of implementation issues for enabling flexible parallel computing on a multi-core shared memory architecture. First, we embed an event-based simulation logic to implement a simplified kinematic wave model and reduce simulation overhead. Second, we present a space-time-event computing framework to decompose simulation steps to reduce communication overhead in parallel execution and an OpenMP-based space-time-processor implementation method that is used to automate task partition tasks. According to the spatial and temporal attributes, various types of simulation events are mapped to independent logical processes that can concurrently execute their procedures while maintaining good load balance. We propose a synchronous space-parallel simulation strategy to dynamically assign the logical processes to different threads. The proposed method is then applied to simulate large-scale, real-world networks to examine the computational efficiency under different numbers of CPU threads. Numerical experiments demonstrate that the implemented parallel computing algorithm can significantly improve the computational efficiency and it can reach up to a speedup of 10 on a workstation with 32 computing threads.     

A new logit‐artificial neural network ensemble for mode choice modeling: a case study for border transport

Logit model is one of the statistical techniques commonly used for mode choice modeling, while artificial neural network (ANN) is a very popular type of artificial intelligence technique used for mode choice modeling. Ensemble learning has evolved to be very effective approach to enhance the performance for many applications through integration of different models. In spite of this advantage, the use of ANN‐based ensembles in mode choice modeling is under explored. The focus of this study is to investigate the use of aforementioned techniques for different number of transportation modes and predictor variables. This study proposes a logit‐ANN ensemble for mode choice modeling and investigates its efficiency in different situations. Travel between Khobar‐Dammam metropolitan area of Saudi Arabia and Kingdom of Bahrain is selected for mode choice modeling. The travel on this route can be performed mainly by air travel or private vehicle through King Fahd causeway. The results show that the proposed ensemble gives consistently better accuracies than single models for multinomial choice problems irrespective of number of input variables. Copyright © 2015 John Wiley & Sons, Ltd.     

Competitiveness of container terminal operating companies in South Korea and the industry–university–government network

Burgeoning container port facilities have fostered intensified competition among container terminal operating companies (CTOCs). However, despite research into their survival strategies which identified antecedents of competitiveness including hard factors such as facilities, available cargo and cargo processing ability, softer factors spanning human resource management, networks and strategic alliances with universities and government agencies in industry–university–government (I–U–G) networks have been overlooked. This study aims to examine both hard and softer antecedents of competitiveness as perceived by 152 professionals in South Korean CTOCs; empirical relationships among these antecedents, I–U–G networks, and competitiveness itself; and the significance of the I–U–G network in establishing and improving competitiveness. Posited antecedents of competitiveness included human resources, facilities, service quality, customer orientation, reputation, and government support policy as independent variables; the I–U–G network as a moderating variable; and competitiveness as a dependent variable. Empirical structural relationships revealed that excepting government support policy, each variable significantly affected CTOC competitiveness. Further, the I–U–G network moderated the relationships between the antecedents of competitiveness and competitiveness. Because an effective I–U–G network was pivotal in controlling CTOC competitiveness, improved competitiveness requires not only differentiation of human resources, facilities, service quality, customer orientation, and reputation factors but also I–U–G network developments.     

基于VRML的虚拟现实技术在数字管道中的应用

介绍了虚拟现实建模语言(VRML),将基于VRML的虚拟现实技术和HTML、 JavaScript相结合,并应用到数字管道中,构建了真实感强、交互性强的可视化虚拟石油管道场景和管道泄漏模型,实现了石油管道虚拟场景的漫游,以及用户与虚拟场景的交互,并及时、直观地反映管道泄漏.应用结果表明:将基于VRML的网络交互式虚拟现实技术应用到数字管道,促进了数字管道的信息共享,提高了数字管道的决策管理效率.