Link travel time inference using entry/exit information of trips on a network

This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.     

A nested recursive logit model for route choice analysis

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible parameter estimates and the fit is significantly better than the RL model. Moreover, the NRL model outperforms the RL model in terms of prediction.     

Data dependent input control for origin–destination demand estimation using observability analysis

In this paper, we address the observability issue of static O–D estimation based on link counts. Unlike most classic observability analyses that relied only on network topological relationships, our analysis incorporates the actual values of input parameters, thus including network operational relations as well. We first analyze possible mathematical properties of an O–D estimation problem with different data input. We then propose a modeling approach based on mixed-integer program for selecting model input that ensures observability and estimation quality. Through establishing a stronger connection between observability analysis and the corresponding estimation problem, the proposed method aims to improve estimation quality while reducing reliance on erroneous data.     

Development and calibration of a long-distance passenger traffic assignment model

This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.     

Empirical estimation of price and income elasticities of air cargo demand: The case of Hong Kong

This paper estimates the price and income elasticities of air cargo demand and examines how they may change after the 2008 financial crisis. Using a set of time series data, we simultaneously estimate the aggregated demand and supply functions of air cargo at Hong Kong International Airport (HKIA). We find that during the entire sampling period of 2001–2013, the price elasticity for air cargo transport demand at HKIA ranges from −0.74 to −0.29, suggesting that air cargo demand in Hong Kong reacts negatively to price (as expected) but does not appear to be very sensitive to price. The income elasticity ranges from 0.29 to 1.47 and appears sensitive to seasonality adjustment approaches. However, in terms of the speed of changes, air cargo demand changes much faster than overall economy, indicating the presence of a pro-cyclical pattern of air cargo traffic with respect to the overall economy. Our analysis shows that air cargo demand becomes more sensitive to changes in both price and income after 2008.     

Point-to-point speed enforcement systems: Speed limits design criteria and analysis of drivers’ compliance

Point-to-point (P2P) speed enforcement is a relatively new approach to traffic law enforcement. Its technology allows vehicles whose average speed exceeds the speed limit over the controlled section to be fined. It therefore encourages compliance over distances longer than those where spot enforcement policies have been in place.In this paper, a procedure for consistently setting speed limits with such enforcement systems is proposed. Such a method has been applied to design the speed limits on two motorways in the district of Naples, Italy, where P2P enforcement systems became operational in 2009 and 2010. The speed limits, which were set using the Italian geometric design standard to assess vehicle stability and stopping sight distance, have been compared with those provided by using well-known international standards.The impact of the newly designed speed limits and of the P2P enforcement system on drivers’ speeding behaviour has been quantified for each highway section and vehicle type. In fact, accurate measurements of the average travel speeds of each vehicle crossing the enforced sections, before and after the activation of the system, were available. The migration from the old speed limits with spot speed enforcement to the new approach resulted in a notable increase in drivers’ compliance to the speed limits with a remarkable decrease in both the average of individual speeds and in their standard deviation.In addition, the analysis of 3 years of data shows that a gradual adaptation of drivers’ behaviour to the system took place. In particular, a decreasing compliance to the speed limits points to a non-optimal system management. Finally, the results of a revealed preference survey allowed us to make a behavioural interpretation regarding the significantly different impacts measured on the two motorways.     

Autonomous cars: The tension between occupant experience and intersection capacity

Systems that enable high levels of vehicle-automation are now beginning to enter the commercial marketplace. Road vehicles capable of operating independently of real-time human control under an increasing set of circumstances will likely become more widely available in the near future. Such vehicles are expected to bring a variety of benefits. Two such anticipated advantages (relative to human-driver vehicle control) are said to be increased road network capacity and the freeing up of the driver-occupant’s time to engage in their choice of leisurely or economically-productive (non-driving) tasks.In this study we investigate the implications for intersection capacity and level-of-service of providing occupants of automated (without real-time human control), autonomously-operating (without vehicle-to-X communication) cars with ride quality that is equivalent (in terms of maximum rates of longitudinal and lateral acceleration) to two types of rail systems: [urban] light rail transit and [inter-urban] high-speed rail. The literature suggests that car passengers start experiencing discomfort at lower rates of acceleration than car drivers; it is therefore plausible that occupants of an autonomously-operating vehicle may wish to instruct their vehicle to maneuver in a way that provides them greater ride comfort than if the vehicle-control algorithm simply mimicked human-driving-operation.On the basis of traffic microsimulation analysis, we found that restricting the dynamics of autonomous cars to the acceleration/deceleration characteristics of both rail systems leads to reductions in a signalized intersection’s vehicle-processing capacity and increases in delay. The impacts were found to be larger when constraining the autonomous cars’ dynamics to the more-restrictive acceleration/deceleration profile of high-speed rail. The scenarios we analyzed must be viewed as boundary conditions, because autonomous cars’ dynamics were by definition never allowed to exceed the acceleration/deceleration constraints of the rail systems. Appropriate evidence regarding motorists’ preferences does not exist at present; establishing these preferences is an important item for the future research agenda.This paper concludes with a brief discussion of research needs to advance this line of inquiry.     

Demi-flexible operating policies to promote the performance of public transit in low-demand areas

The efforts of providing attractive transport service to residents in sparse communities have previously focused on operating flexible transit services. This paper identifies a new category of transit policies, called demi-flexible operating policies, to fill the gap between flexible transit services and conventional fixed-route systems. The passenger cost function is defined as the performance measure of transit systems and the analytic work is performed based on a real-world flag-stop transit service, in which we compare its system performance with another two comparable systems, the fixed-route and flex-route services, at expected and unexpected demand levels in order to be closer to reality. In addition, the dynamic-station policy is introduced to assist the flex-route service to better deal with unexpectedly high demand. Experiments demonstrate the unique advantages of demi-flexible operating policies in providing affordable, efficient, and reliable transport service in low-demand operating environments and this work is helpful to optimize the unifying framework for designing public transit in suburban and rural areas.     

弹性需求和多用户随机平衡下的连续网络设计

连续平衡网络设计问题是在连续决策变量的条件下,寻找最优的用于道路网络中某些路段扩建的投资决策方案。文中从代表性消费者理论出发,建立了该问题的基于弹性需求和多用户类型随机用户平衡的双层规划模型,并考虑了路段能力约束。基于双层模型求解的复杂性,设计了基于混沌优化方法的启发式算法,实例计算结果表明该模型与算法是有效的。     

On the degradation of performance for traffic networks with oblivious users

We consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their route simply on the distances they observe on a map, without thinking (or knowing, or caring) about the delays experienced on this route due to their fellow travelers. In this work we study the effect of such users using as the measure of network performance its price of anarchy, i.e., the ratio of the total latency experienced by the users (oblivious or not) at equilibrium over the social optimum.