Time use in travel surveys and time use surveys – Two sides of the same coin?

An in-depth understanding of travel behaviour determinants, including the relationship to non-travel activities, is the foundation for modelling and policy making. National Travel Surveys (NTS) and time use surveys (TUS) are two major data sources for travel behaviour and activity participation. The aim of this paper is to systematically compare both survey types regarding travel activities and non-travel activities. The analyses are based on the German National Travel Survey and the German National Time Use Survey from 2002.The number of trips and daily travel time for mobile respondents were computed as the main travel estimates. The number of trips per person is higher in the German TUS when changes in location without a trip are included. Location changes without a trip are consecutive non-trip activities with different locations but without a trip in-between. The daily travel time is consistently higher in the German TUS. The main reason for this difference is the 10-min interval used. Differences in travel estimates between the German TUS and NTS result from several interaction effects. Activity time in NTS is comparable with TUS for subsistence activities.Our analyses confirm that both survey types have advantages and disadvantages. TUS provide reliable travel estimates. The number of trips even seems preferable to NTS if missed trips are properly identified and considered. Daily travel times are somewhat exaggerated due to the 10-min interval. The fixed time interval is the most important limitation of TUS data. The result is that trip times in TUS do not represent actual trip times very well and should be treated with caution.We can use NTS activity data for subsistence activities between the first trip and the last trip. This can potentially benefit activity-based approaches since most activities before the first trip and after the last trip are typical home-based activities which are rarely substituted by out-of-home activities.     

Estimating the most likely space–time paths,dwell times and path uncertainties from vehicle trajectory data: A time geographic method

Global Positioning System and other location-based services record vehicles’ spatial locations at discrete time stamps. Considering these recorded locations in space with given specific time stamps, this paper proposes a novel time-dependent graph model to estimate their likely space–time paths and their uncertainties within a transportation network. The proposed model adopts theories in time geography and produces the feasible network–time paths, the expected link travel times and dwell times at possible intermediate stops. A dynamic programming algorithm implements the model for both offline and real-time applications. To estimate the uncertainty, this paper also develops a method based on the potential path area for all feasible network–time paths. This paper uses a set of real-world trajectory data to illustrate the proposed model, prove the accuracy of estimated results and demonstrate the computational efficiency of the estimation algorithm.     

Estimating time dependent O‐D trip tables during peak periods

Intelligent transportation systems (ITS) have been used to alleviate congestion problems arising due to demand during peak periods. The success of ITS strategies relies heavily on two factors: 1) the ability to accurately estimate the temporal and spatial distribution of travel demand on the transportation network during peak periods, and, 2) providing real‐time route guidance to users. This paper addresses the first factor. A model to estimate time dependent origin‐destination (O‐D) trip tables in urban areas during peak periods is proposed. The daily peak travel period is divided into several time slices to facilitate simulation and modeling. In urban areas, a majority of the trips during peak periods are work trips. For illustration purposes, only peak period work trips are considered in this paper. The proposed methodology is based on the arrival pattern of trips at a traffic analysis zone (TAZ) and the distribution of their travel times. The travel time matrix for the peak period, the O‐D trip table for the peak period, and the number of trips expected to arrive at each TAZ at different work start times are inputs to the model. The model outputs are O‐D trip tables for each time slice in the peak period. 1995 data for the Las Vegas metropolitan area are considered for testing and validating the model, and its application. The model is reasonably robust, but some lack of precision was observed. This is due to two possible reasons: 1) rounding‐off, and, 2) low ratio of total number of trips to total number of O‐D pair combinations. Hence, an attempt is made to study the effect of increasing this ratio on error estimates. The ratio is increased by multiplying each O‐D pair trip element with a scaling factor. Better estimates were obtained. Computational issues involved with the simulation and modeling process are discussed.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks

Applications of dynamic network equilibrium models have, mostly, considered the unit of traffic demand either as one-way trip, or as multiple independent trips. However, individuals’ travel patterns typically follow a sequence of trips chained together. In this study we aim at developing a general simulation-based dynamic network equilibrium algorithm for assignment of activity-trip chain demand. The trip chain of each individual trip maker is defined by the departure time at origin, sequence of activity destination locations, including the location of their intermediate destinations and their final destination, and activity duration at each of the intermediate destinations. Spatial and temporal dependency of subsequent trips on each other necessitate time and memory consuming calculations and storage of node-to-node time-dependent least generalized cost path trees, which is not practical for very large metropolitan area networks. We first propose a reformulation of the trip-based demand gap function formulation for the variational inequality formulation of the Bi-criterion Dynamic User Equilibrium (BDUE) problem. Next, we propose a solution algorithm for solving the BDUE problem with daily chain of activity-trips. Implementation of the algorithm for very large networks circumvents the need to store memory-intensive node-to-node time-dependent shortest path trees by implementing a destination-based time-dependent least generalized cost path finding algorithm, while maintaining the spatial and temporal dependency of subsequent trips. Numerical results for a real-world large scale network suggest that recognizing the dependency of multiple trips of a chain, and maintaining the departure time consistency of subsequent trips provide sharper drops in gap values, hence, the convergence could be achieved faster (compared to when trips are considered independent of each other).     

Traveler delay costs and value of time with trip chains, flexible activity scheduling and information

The delay costs of traffic disruptions and congestion and the value of travel time reliability are typically evaluated using single trip scheduling models, which treat the trip in isolation of previous and subsequent trips and activities. In practice, however, when activity scheduling to some extent is flexible, the impact of delay on one trip will depend on the actual and predicted travel time on itself as well as other trips, which is important to consider for long-lasting disturbances and when assessing the value of travel information. In this paper we extend the single trip approach into a two trips chain and activity scheduling model. Preferences are represented as marginal activity utility functions that take scheduling flexibility into account. We analytically derive trip timing optimality conditions, the value of travel time and schedule adjustments in response to travel time increases. We show how the single trip models are special cases of the present model and can be generalized to a setting with trip chains and flexible scheduling. We investigate numerically how the delay cost depends on the delay duration and its distribution on different trips during the day, the accuracy of delay prediction and travel information, and the scheduling flexibility of work hours. The extension of the model framework to more complex schedules is discussed.     

A two-stage stochastic optimization model for the transfer activity choice in metro networks

This research focuses on finding the best transfer schemes in metro networks. Using sample-based time-invariant link travel times to capture the uncertainty of a realistic network, a two-stage stochastic integer programming model with the minimized expected travel time and penalty value incurred by transfer activities is formulated. The first stage aims to find a sequence of potential transfer nodes (stations) that can compose a feasible path from origins to destinations in the transfer activity network, and the second stage provides the least time paths passing by the generated transfer stations in the first stage for evaluating the given transfer schemes and then outputs the best routing information. To solve our proposed model, an efficient hybrid algorithm, in which the label correcting algorithm is embedded into a branch and bound searching framework, is presented to find the optimal solutions of the considered problem. Finally, the numerical experiments are implemented in different scales of metro networks. The computational results demonstrate the effectiveness and performance of the proposed approaches even for the large-scale Beijing metro network.     

The travel and environmental implications of shared autonomous vehicles,using agent-based model scenarios

Carsharing programs that operate as short-term vehicle rentals (often for one-way trips before ending the rental) like Car2Go and ZipCar have quickly expanded, with the number of US users doubling every 1–2 years over the past decade. Such programs seek to shift personal transportation choices from an owned asset to a service used on demand. The advent of autonomous or fully self-driving vehicles will address many current carsharing barriers, including users’ travel to access available vehicles.This work describes the design of an agent-based model for shared autonomous vehicle (SAV) operations, the results of many case-study applications using this model, and the estimated environmental benefits of such settings, versus conventional vehicle ownership and use. The model operates by generating trips throughout a grid-based urban area, with each trip assigned an origin, destination and departure time, to mimic realistic travel profiles. A preliminary model run estimates the SAV fleet size required to reasonably service all trips, also using a variety of vehicle relocation strategies that seek to minimize future traveler wait times. Next, the model is run over one-hundred days, with driverless vehicles ferrying travelers from one destination to the next. During each 5-min interval, some unused SAVs relocate, attempting to shorten wait times for next-period travelers.Case studies vary trip generation rates, trip distribution patterns, network congestion levels, service area size, vehicle relocation strategies, and fleet size. Preliminary results indicate that each SAV can replace around eleven conventional vehicles, but adds up to 10% more travel distance than comparable non-SAV trips, resulting in overall beneficial emissions impacts, once fleet-efficiency changes and embodied versus in-use emissions are assessed.     

A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times

This paper develops an algorithm for optimally locating Automatic Vehicle Identification tag readers by maximizing the benefit that would accrue from measuring travel times on a transportation network. The problem is formulated as a quadratic 0–1 optimization problem where the objective function parameters represent benefit factors that capture the relevance of measuring travel times as reflected by the demand and travel time variability along specified trips. An optimization approach based on the Reformulation–Linearization Technique coupled with semidefinite programming concepts is designed to solve the formulated reader location problem. To illustrate the proposed methodology, we consider a transportation network that is comprised of freeway segments that might include merge, diverge, weaving, and bottleneck sections. In order to derive benefit factors for the various origin–destination pairs on this network, we employ a simulation package (INTEGRATION) in combination with a composite function, which estimates the travel time variability along a trip that is comprised of links that include any of the four identified sections. The simulation results are actually recorded as generic look-up tables that can be used for any such section for the purpose of computing the associated benefit factor coefficients. Computational results are presented using data pertaining to a freeway section in San Antonio, Texas, as well as synthetic test cases, to demonstrate the effectiveness of the proposed approach, and to study the sensitivity of the quality of the solution to variations in the number of available readers.     

Ramp meters on trial: Evidence from the Twin Cities metering holiday

Ramp meters in the Twin Cities have been the subject of a recent test of their effectiveness, involving turning them off for eight weeks. This paper analyzes the results with and without ramp metering for several representative freeways during the afternoon peak period. Seven performance measures: mobility, equity, productivity, consumers’ surplus, accessibility, travel time variation and travel demand responses are compared. It is found that ramp meters are particularly helpful for long trips relative to short trips. Ramp metering, while generally beneficial to freeway segments, may not improve trip travel times (including ramp delays). The reduction in travel time variation comprises another benefit from ramp meters. Non-work trips and work trips respond differently to ramp meters. The results are mixed, suggesting a more refined ramp control algorithm, which explicitly considers ramp delay, is in order.     

Decomposing travel times measured by probe-based traffic monitoring systems to individual road segments

In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.     

Travel time estimation for urban road networks using low frequency probe vehicle data

The paper presents a statistical model for urban road network travel time estimation using vehicle trajectories obtained from low frequency GPS probes as observations, where the vehicles typically cover multiple network links between reports. The network model separates trip travel times into link travel times and intersection delays and allows correlation between travel times on different network links based on a spatial moving average (SMA) structure. The observation model presents a way to estimate the parameters of the network model, including the correlation structure, through low frequency sampling of vehicle traces. Link-specific effects are combined with link attributes (speed limit, functional class, etc.) and trip conditions (day of week, season, weather, etc.) as explanatory variables. The approach captures the underlying factors behind spatial and temporal variations in speeds, which is useful for traffic management, planning and forecasting. The model is estimated using maximum likelihood. The model is applied in a case study for the network of Stockholm, Sweden. Link attributes and trip conditions (including recent snowfall) have significant effects on travel times and there is significant positive correlation between segments. The case study highlights the potential of using sparse probe vehicle data for monitoring the performance of the urban transport system.     

Calibrating aggregate travel demand models with traffic counts: Estimators and statistical performance

Traffic counts on network links constitute an information source on travel demand which is easy to collect, cheap and repeatable. Many models proposed in recent years deal with the use of traffic counts to estimate Origin/Destination (O/D) trip matrices under different assumptions on the type of "a-priori" information available on the demand (surveys, outdated estimates, models, etc.) and the type of network and assignment mapping (see Cascetta & Nguyen 1988). Less attention has been paid to the possibility of using traffic counts to estimate the parameters of demand models. In this case most of the proposed methods are relative to particular demand model structures (e.g. gravity-type) and the statistical analysis of estimator performance is not thoroughly carried out. In this paper a general statistical framework defining Maximum Likelihood, Non Linear Generalized Least Squares (NGLS) and Bayes estimators of aggregated demand model parameters combining counts-based information with other sources (sample or a priori estimates) is proposed first, thus extending and generalizing previous work by the authors (Cascetta & Russo 1992). Subsequently a solution algorithm of the projected-gradient type is proposed for the NGLS estimator given its convenient theoretical and computational properties. The algorithm is based on a combination of analytical/numerical derivates in order to make the estimator applicable to general demand models. Statistical performances of the proposed estimators are evaluated on a small test network through a Monte Carlo method by repeatedly sampling "starting estimates" of the (known) parameters of a generation/distribution/modal split/assignment system of models. Tests were carried out assuming different levels of "quality" of starting estimates and numbers of available counts. Finally NGLS estimator was applied to the calibration of the described model system on the network of a real medium-size Italian town using real counts with very satisfactory results in terms of both parameter values and counted flows reproduction.     

Latent temporal preferences: An application to airline travel

An essential element of demand modeling in the airline industry is the representation of time of day demand—the demand for a given itinerary as a function of its departure or arrival times. It is an important datum that drives successful scheduling and fleet decisions. There are two key components to this problem: the distribution of the time of day demand and how preferred travel time influences itinerary choice. This paper focuses on estimating the time of day distribution. Our objective is to estimate it in a manner that is not confounded with air travel supply; is a function of the characteristics of the traveler, the trip, and the market; and accounts for potential measurement errors in self-reported travel time preferences. We employ a stated preference dataset collected by intercepting people who were booking continental US trips via an internet booking service. Respondents reported preferred travel times as well as choices from a hypothetical set of itineraries. We parameterize the time of day distribution as a mixture of normal distributions (due to the strong peaking nature of travel time preferences) and allow the mixing function to vary by individual characteristics and trip attributes. We estimate the time of day distribution and the itinerary choice model jointly in a manner that accounts for measurement error in the self-reported travel time preferences. We find that the mixture of normal distributions fits the time of day distribution well and is behaviorally intuitive. The strongest covariates of travel time preferences are party size and time zone change. The methodology employed to treat self-reported travel time preferences as potentially having error contributes to the broader transportation time of day demand literature, which either assumes that the desired travel times are known with certainty or that they are unknown. We find that the error in self-reported travel time preferences is statistically significant and impacts the inferred time of day demand distribution.     

Joint leisure travel optimization with user-generated data via perceived utility maximization

The lack of personalized solutions for managing the demand of joint leisure trips in cities in real time hinders the optimization of transportation system operations. Joint leisure activities can account for up to 60% of trips in cities and unlike fixed trips (i.e., trips to work where the arrival time and the trip destination are predefined), leisure activities offer more optimization flexibility since the activity destination and the arrival times of individuals can vary.To address this problem, a perceived utility model derived from non-traditional data such as smartphones/social media for representing users’ willingness to travel a certain distance for participating in leisure activities at different times of day is presented. Then, a stochastic annealing search method for addressing the exponential complexity optimization problem is introduced. The stochastic annealing method suggests the preferred location of a joint leisure activity and the arrival times of individuals based on the users’ preferences derived from the perceived utility model. Test-case implementations of the approach used 14-month social media data from London and showcased an increase of up to 3 times at individuals’ satisfaction while the computational complexity is reduced to almost linear time serving the real-time implementation requirements.     

Traffic assignment by trip type using volume restraint and link restraint for application in small urban areas

This research involved the development of a new traffic assignment model consisting of a set of procedures for an urbanized area with a population of 172,000. Historical, social, and economic data were used as input to conventional trip generation and trip distribution models to produce a trip table for network assignment. This fixed table was divided into three trip types: external-external trips, external-internal trips, and internal-internal trips. The methodology used to develop the new traffic assignment model assigned each of the trip types by varying the diversion of trips from the minimum path. External-external trips were assigned on a minimum path routing and external-internal trips were assigned with a slight diversion from the minimum path. Internal-internal trips were assigned with more diversion than external-internal trips and adjusted by utilizing iterative volume restraint and incremental link restraint. A statistical analysis indicated that assigning trips by trip types using trip diversion and volume and link restraint produces a significant improvement in the accuracy of the assigned traffic volumes.     

Effects of household structure and selected travel characteristics on trip chaining

This paper analyzes trip chaining, focusing on how households organize non-work travel. A trip chaining typology is developed using household survey data from Portland, Oregon. Households are organized according to demographic structure, allowing analysis of trip chaining differences among household types. A logit model of the propensity to link non-work trips to the work commute is estimated. A more general model of household allocation of non-work travel among three alternative chain types — work commutes, multi-stop non-work journeys, and unlinked trips — is also developed and estimated. Empirical results indicate that the likelihood of linking work and non-work travel, and the more general organization of non-work travel, varies with respect to household structure and other factors which previous studies have found to be important. The effects of two congestion indicators on trip chaining were mixed: workers who commuted in peak periods were found to have lower propensity to form work/non-work chains, while a more general congestion indicator had no effect on the allocation of non-work trips among alternative chains.     

Probe vehicle based real-time traffic monitoring on urban roadways

Travel time estimation and prediction on urban arterials is an important component of Active Traffic and Demand Management Systems (ATDMS). This paper aims in using the information of GPS probes to augment less dynamic but available information describing arterial travel times. The direction followed in this paper chooses a cooperative approach in travel time estimation using static information describing arterial geometry and signal timing, semi-dynamic information of historical travel time distributions per time of day, and utilizes GPS probe information to augment and improve the latter. First, arterial travel times are classified by identifying different travel time states, then link travel time distributions are approximated using mixtures of normal distributions. If prior travel time data is available, travel time distributions can be estimated empirically. Otherwise, travel time distribution can be estimated based on signal timing and arterial geometry. Real-time GPS travel time data is then used to identify the current traffic condition based on Bayes Theorem. Moreover, these GPS data can also be used to update the parameters of the travel time distributions using a Bayesian update. The iterative update process makes the posterior distributions more and more accurate. Finally, two comprehensive case studies using the NGSIM Peachtree Street dataset, and GPS data of Washington Avenue in Minneapolis, were conducted. The first case study estimated prior travel time distributions based on signal timing and arterial geometry under different traffic conditions. Travel time data were classified and corresponding distributions were updated. In addition, results from the Bayesian update and EM algorithm were compared. The second case study first tested the methodologies based on real GPS data and showed the importance of sample size. In addition, a methodology was proposed to distinguish new traffic conditions in the second case study.     

Route choice of cyclists in Zurich

This paper presents the first route choice model for bicyclists estimated from a large sample of GPS observations and overcomes the limitations inherent in the generally employed stated preference approach. It employs an improved mode detection algorithm for GPS post-processing to determine trips made by bicycle, which are map matched to an enriched street network. The alternatives are generated as a random sample from an exhaustive, but constrained search. Accounting for the similarity between the alternatives with the path-size factor the MNL estimates show that the elasticity with regards to trip length is nearly four times larger than that with respect to the share of bike paths. The elasticity with respect to the product of length and maximum gradient of the route is small. No other variable describing the routes had an impact. The heterogeneity of the cyclists is captured through interaction terms formulated on their average behaviour.     

Estimating travel times and vehicle trajectories on freeways using dual loop detectors

Recent research has investigated various means of measuring link travel times on freeways. This search has been motivated in part by the fact that travel time is considered to be more informative to users than local velocity measurements at a detector station. But direct travel time measurement requires the correlation of vehicle observations at multiple locations, which in turn requires new communications infrastructure and/or new detector hardware. This paper presents a method for estimating link travel time using data from an individual dual loop detector, without requiring any new hardware. The estimation technique exploits basic traffic flow theory to extrapolate local conditions to an extended link. In the process of estimating travel times, the algorithm also estimates vehicle trajectories. The work demonstrates that the travel time estimates are very good provided there are no sources of delay, such as an incident, within a link.