Aggregating mobile object trajectories: cumulative time geographic density estimation for GPS data

We present new approaches that expand upon the time geographic density estimation (TGDE) framework previously employed to estimate potential path trees. In the past, TGDE metrics have identified possible locations an individual moving object may have passed between, given known origin and destination points. This paper utilizes a new form of TGDE to investigate taxicab GPS traces over a specified time horizon with position ‘gaps’. To this end, we propose a new extension to the TGDE framework, TGDE-C, which is used to determine the cumulative TGDE values for a group of GPS traces, at a given location. These metrics are applied to multiple taxis and allow for time of day analysis. Additionally, we combine these new extensions with existing TGDE metrics that allow us to determine how accessible individual or groups of vehicles are to urban opportunities.     

Formulating cargo inventory costs for liner shipping network design

This study examines how to incorporate the inventory costs of containerized cargoes into existing liner service planning models such that the designed networks could be improved while not causing extra modeling/computational burden. Two approaches are compared: (i) not considering the inventory costs at all and (ii) incorporating the inventory costs associated with onboard time and those related to transshipment by assuming a fixed connection time. The two models are compared with the ideal model capturing the exact inventory costs on a route choice problem and a capacity planning problem based on extensive randomly generated and practical numerical experiments. The results show that: first, ignoring the inventory costs in service planning models may lead to network design with much higher costs (poor network design decisions); second, in service planning models assuming weekly frequency, the inventory costs associated with onboard time could be formulated exactly, and those related to the connection time of weekly services could be approximated by assuming fixed connection time of 3.5 days for ports with 1 day’s minimum connection time and 4.5 days for ports with 2 days’ minimum connection time.     

Mathematically calculating the transit time of cargo through a liner shipping network with various trans-shipment policies

This paper derives the mathematical expressions for the transit time of cargo through a liner shipping network. Main efforts are devoted to deriving the calculation expressions of the connection time of cargo during trans-shipment. For the forward and many-to-one trans-shipment policies, we conduct a minor correction towards the expressions in existing studies to improve the completeness. Meanwhile, we propose an alternative but more straightforward calculation method for connection time which bypasses the complicated inductive argument in existing studies. Then we introduce two new trans-shipment policies: backward trans-shipment and one-to-many trans-shipment, and mathematically calculate the corresponding connection times. Numerical experiments also deliver some managerial insights into the effectiveness of backward trans-shipment in transit time control.     

The Storage Space Allocation Problem at a Container Terminal

Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines.     

How Do Governments Support the Development of Public Private Partnerships? Measuring and Comparing PPP Governmental Support in 20 European Countries

Abstract

Taking an institutional perspective, in this article we develop an index of the governmental support for public private partnership (PPP) — a ‘PPP Governmental Support Index’ (GSI) — which aims to measure the extent to which national governments provide an institutional framework that is either conducive or preventive for the introduction and diffusion of PPPs within transport infrastructure and other sectors. First, based on a substantive review of the literature, we define the elements of the PPP GSI, including the policy and political commitment regarding PPPs, the legal and regulatory framework, and the presence/absence of dedicated PPP-supporting arrangements. Second, we calculate the PPP GSI for 20 European countries, cluster them and compare similarities and differences in national governmental support of infrastructure PPPs. Third, we explore the potential link between national institutional index scores and infrastructure PPP activity in the 20 countries. Lastly, we discuss the potential and usefulness of the presented PPP GSI, as well as methodological limitations, and elaborate on how this index might be utilised to strengthen future comparative research on PPP in transport and other sectors.     

The role of volume-delay functions in forecasting and evaluating congestion charging schemes: the Stockholm case

This paper uses observations from before and during the Stockkholm congestion charging trial in order to validate and improve a transportation model for Stockholm. The model overestimates the impact of the charges on traffic volumes while at the same time it substantially underestimates the impact on travel times. These forecast errors lead to considerable underestimation of economic benefits which are dominated by travel time savings. The source of error lies in the static assignment that is used in the model. Making the volume-delay functions (VDFs) steeper only marginally improves the quality of forecast but strongly impacts the result of benefit calculations. We therefore conclude that the dynamic assignment is crucial for an informed decision on introducing measures aimed at relieving congestion. However, in the absence of such a calibrated dynamic model for a city, we recommend that at least a sensitivity analysis with respect to the slope of VDFs is performed.     

A stochastic model of traffic flow: Theoretical foundations

In a variety of applications of traffic flow, including traffic simulation, real-time estimation and prediction, one requires a probabilistic model of traffic flow. The usual approach to constructing such models involves the addition of random noise terms to deterministic equations, which could lead to negative traffic densities and mean dynamics that are inconsistent with the original deterministic dynamics. This paper offers a new stochastic model of traffic flow that addresses these issues. The source of randomness in the proposed model is the uncertainty inherent in driver gap choice, which is represented by random state dependent vehicle time headways. A wide range of time headway distributions is allowed. From the random time headways, counting processes are defined, which represent cumulative flows across cell boundaries in a discrete space and continuous time conservation framework. We show that our construction implicitly ensures non-negativity of traffic densities and that the fluid limit of the stochastic model is consistent with cell transmission model (CTM) based deterministic dynamics.     

An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks

As intelligent transportation systems (ITS) approach the realm of widespread deployment, there is an increasing need to robustly capture the variability of link travel time in real-time to generate reliable predictions of real-time traffic conditions. This study proposes an adaptive information fusion model to predict the short-term link travel time distribution by iteratively combining past information on link travel time on the current day with the real-time link travel time information available at discrete time points. The past link travel time information is represented as a discrete distribution. The real-time link travel time is represented as a range, and is characterized using information quality in terms of information accuracy and time delay. A nonlinear programming formulation is used to specify the adaptive information fusion model to update the short-term link travel time distribution by focusing on information quality. The model adapts good information by weighing it higher while shielding the effects of bad information by reducing its weight. Numerical experiments suggest that the proposed model adequately represents the short-term link travel time distribution in terms of accuracy and robustness, while ensuring consistency with ambient traffic flow conditions. Further, they illustrate that the mean of a representative short-term travel time distribution is not necessarily a good tracking indicator of the actual (ground truth) time-dependent travel time on that link. Parametric sensitivity analysis illustrates that information accuracy significantly influences the model, and dominates the effects of time delay and the consistency constraint parameter. The proposed information fusion model bridges key methodological gaps in the ITS deployment context related to information fusion and the need for short-term travel time distributions.     

Recursive estimation of average vehicle time headway using single inductive loop detector data

Vehicle time headway is an important traffic parameter. It affects roadway safety, capacity, and level of service. Single inductive loop detectors are widely deployed in road networks, supplying a wealth of information on the current status of traffic flow. In this paper, we perform Bayesian analysis to online estimate average vehicle time headway using the data collected from a single inductive loop detector. We consider three different scenarios, i.e. light, congested, and disturbed traffic conditions, and have developed a set of unified recursive estimation equations that can be applied to all three scenarios. The computational overhead of updating the estimate is kept to a minimum. The developed recursive method provides an efficient way for the online monitoring of roadway safety and level of service. The method is illustrated using a simulation study and real traffic data.     

Understanding the impacts of a combination of service improvement strategies on bus running time and passenger’s perception

Transit agencies implement many strategies in order to provide an attractive transportation service. This article aims to evaluate the impacts of implementing a combination of strategies, designed to improve the bus transit service, on running time and passenger satisfaction. These strategies include using smart card fare collection, introducing limited-stop bus service, implementing reserved bus lanes, using articulated buses, and implementing transit signal priority (TSP). This study uses stop-level data collected from the Société de transport de Montréal (STM)’s automatic vehicle location (AVL) and automatic passenger count (APC) systems, in Montréal, Canada. The combination of these strategies has lead to a 10.5% decline in running time along the limited stop service compared to the regular service. The regular route running time has increased by 1% on average compared to the initial time period. The study also shows that riders are generally satisfied with the service improvements. They tend to overestimate the savings associated with the implementation of this combination of strategies by 3.5-6.0 min and by 2.5-4.1 min for both the regular route and the limited stop service, respectively. This study helps transit planners and policy makers to better understand the effects of implementing a combination of strategies to improve running time and passenger’s perception of these changes in service.