Modeling drivers' diversion from normal routes under ATIS using generalized estimating equations and binomial probit link function

Advanced Traveler Information Systems (ATIS) provide travelers with real time traffic information to optimize their travel choices. The objective of this paper is to model drivers' diversion from their normal routes in the provision of ATIS. Five different scenarios of traffic information are used. Generalized Estimating Equations (GEE) framework with repeated observations and binomial probit link function is introduced and implemented. GEE with four different correlation structures including the independent case are developed and compared with each other and with regular Maximum Likelihood Estimation (MLE). A travel simulator was used. Sixty-five subjects have traveled 10 simulated trial days each on a 40-link realistic network with real historical congestion levels. The results showed that providing traffic information increases the probability of drivers' diversion from their normal routes. Adding advice to the pre-trip and/or en-route information encourages drivers to divert. Providing en-route in addition to the pre-trip information with or without advice increases the diversion probability. High travel time on the normal route and less travel time on the diverted route increase the probability of diversion. High-educated drivers are less likely to divert. Expressway users are more likely to divert from their normal routes under ATIS. Drivers' familiarity with the device that provides the information and high number of traffic signals on the normal route increase the diversion probability.     

Multi-state supernetwork framework for the two-person joint travel problem

Most travel behavior studies on route and mode choice focus only on an individual level. This paper adopts the concept of multi-state supernetworks to model the two-person joint travel problem (JTP). Travel is differentiated in terms of activity-vehicle-joint states, i.e. travel separately or jointly with which transport mode and with which activities conducted. In each state, route choice can be addressed given the state information and travel preference parameters. The joint travel pattern space is represented as a multi-state supernetwork, which is constructed by assigning the individual and joint networks to all possible states and connecting them via transfer links at joints where individuals can meet or depart. Besides route choice, the choices of where and when to meet, and which transport mode(s) to use can all be explicitly represented in a consistent fashion. A joint path through the supernetwork corresponds to a specific joint travel pattern. Then, JTP is reduced to an optimization problem to find the joint path with the minimum disutility. Three standard shortest path algorithm variants are proposed to find the optimal under different scenarios. The proposed framework further indicates the feasibility of multi-state supernetworks for addressing high dimensional problems and contributes to the design of a next generation of joint routing systems.     

Determining structural route components from GPS traces

Analysis of GPS traces shows that people often do not use the least cost path through the transportation network while making trips. This leads to the question which structural path characteristics can be used to construct realistic route choice sets for use in traffic simulation models. In this paper, we investigate the hypothesis that, for utilitarian trips, the route between origin and destination consists of a small number of concatenated least cost paths. The hypothesis is verified by analyzing routes extracted from large sets of recorded GPS traces which constitute revealed preference information. Trips have been extracted from the traces and for each trip the path in the transportation network is determined by map matching. This is followed by a path decomposition phase for which the algorithm constitutes the first contribution of this paper. There are multiple ways to split a given path in a directed graph into a minimal number of subpaths of minimal cost. By calculating two specific path splittings, it is possible to identify subsets of the vertices (splitVertexSuites) that can be used to generate every possible minimum path splitting by taking one vertex from each such subset. As a second contribution, we show how the extracted information is used in microscopic travel simulation. The distribution for the size of the minimum decomposition, extracted from the GPS traces, can be used in constrained enumeration methods for route choice set generation. The sets of vertices that can act as boundary vertices separating consecutive route parts contain way points (landmarks) having a particular meaning to their user. The paper explains the theoretical aspects of route splitting as well as the process to extract splitVertexSuites from big data. It reports statistical distributions extracted from sets of GPS traces for both multimodal person movements and unimodal car trips.     

Cognitive cost in route choice with real-time information: An exploratory analysis

Real-time traffic information is increasingly available to support route choice decisions by reducing the travel time uncertainty. However it is likely that a traveler cannot assess all available information on all alternative routes due to time constraints and limited cognitive capacity. This paper presents a model that is consistent with a general network topology and can potentially be estimated based on revealed preference data. It explicitly takes into account the information acquisition and the subsequent path choice. The decision to acquire information is assumed to be based on the cognitive cost involved in the search and the expected benefit defined as the expected increase in utility after the search. A latent class model is proposed, where the decision to search or not to search and the depth of the search are latent and only the final path choices are observed. A synthetic data set is used for the purpose of validation and ease of illustration. The data are generated from the postulated cognitive-cost model, and estimation results show that the true values of the parameters can be recovered with enough variability in the data. Two other models with simplifying assumptions of no information and full information are also estimated with the same set of data with significantly biased path choice utility parameters. Prediction results show that a smaller cognitive cost encourages information search on risky and fast routes and thus higher shares on those routes. As a result, the expected average travel time decreases and the variability increases. The no-information and full-information models are extreme cases of the more general cognitive-cost model in some cases, but not generally so, and thus the increasing ease of information acquisition does not necessarily warrant a full-information model.     

Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review

Several route choice models are reviewed in the context of the stochastic user equilibrium problem. The traffic assignment problem has been extensively studied in the literature. Several models were developed focusing mainly on the solution of the link flow pattern for congested urban areas. The behavioural assumption governing route choice, which is the essential part of any traffic assignment model, received relatively much less attention. The core of any traffic assignment method is the route choice model. In the wellknown deterministic case, a simple choice model is assumed in which drivers choose their best route. The assumption of perfect knowledge of travel costs has been long considered inadequate to explain travel behaviour. Consequently, probabilistic route choice models were developed in which drivers were assumed to minimize their perceived costs given a set of routes. The objective of the paper is to review the different route choice models used to solve the traffic assignment problem. Focus is on the different model structures. The paper connects some of the route choice models proposed long ago, such as the logit and probit models, with recently developed models. It discusses several extensions to the simple logit model, as well as the choice set generation problem and the incorporation of the models in the assignment problem.     

The allocation of buses in heavily utilized networks with overlapping routes

Many transit systems outside North America are characterized by networks with extensively overlapping routes and buses frequently operating at, or close to, capacity. This paper addresses the problem of allocating a fleet of buses between routes in this type of system; a problem that must be solved recurrently by transit planners. A formulation of the problem is developed which recognizes passenger route choice behavior, and seeks to minimize a function of passenger wait time and bus crowding subject to constraints on the number of buses available and the provision of enough capacity on each route to carry all passengers who would select it. An algorithm is developed based on the decomposition of the problem into base allocation and surplus allocation components. The base allocation identifies a feasible solution using an (approx.) minimum number of buses. The surplus allocation is illustrated for the simple objective of minimizing the maximum crowding level on any route. The bus allocation procedure developed in this paper has been applied to part of the Cairo bus system in a completely manual procedure, and is proposed to be the central element of a short-range bus service planning process for that city.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Dynamic activity-travel assignment in multi-state supernetworks

The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.     

A bi-objective cyclist route choice model

It is widely acknowledged that cyclists choose their route differently to drivers of private vehicles. The route choice decision of commuter drivers is often modelled with one objective, to reduce their generalised travel cost, which is a monetary value representing the combined travel time and vehicle operating cost. Commuter cyclists, on the other hand, usually have multiple incommensurable objectives when choosing their route: the travel time and the suitability of a route. By suitability we mean non-subjective factors that characterise the suitability of a route for cycling, including safety, traffic volumes, traffic speeds, presence of bicycle lanes, whether the terrain is flat or hilly, etc. While these incommensurable objectives are difficult to be combined into a single objective, it is also important to take into account that each individual cyclist may prioritise differently between travel time and suitability when they choose a route.This paper proposes a novel model to determine the route choice set of commuter cyclists by formulating a bi-objective routing problem. The two objectives considered are travel time and suitability of a route for cycling. Rather than determining a single route for a cyclist, we determine a choice set of optimal alternative routes (efficient routes) from which a cyclist may select one according to their personal preference depending on their perception of travel time versus other route choice criteria considered in the suitability index. This method is then implemented in a case study in Auckland, New Zealand.The study provides a starting point for the trip assignment of cyclists, and with further research, the bi-objective routing model developed can be applied to create a complete travel demand forecast model for cycle trips. We also suggest the application of the developed methodology as an algorithm in an interactive route finder to suggest efficient route choices at different levels of suitability to cyclists and potential cyclists.     

Perception bias in route choice

Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against non-chosen options even if these are faster. In this paper, we study travel time perception and route choice of routes with different degrees of road hierarchy and directness. In the Dutch city of Enschede, respondents were asked to choose a route and provide their estimated travel times for both the preferred and alternative routes. These travel times were then compared with actual travel times. Results from previous studies were confirmed and expanded. The shortest time route was chosen in 41 % of the cases while the perceived shortest time route was chosen by almost 80 % of the respondents. Respondents overestimated travel time in general but overestimated the travel time of non-chosen routes more than the travel time of chosen routes. Perception of travel time depends on road hierarchy and route directness, as more direct routes and routes higher up in the hierarchy were perceived as being relatively fast. In addition, there is evidence that these attributes also influence route choice independently of perceived travel time. Finally, travel time perceptions appear to be most strongly biased against non-chosen options when respondents were familiar with the route or indicated a clear preference for the chosen routes. This result indicates that behavior will be more difficult to change for the regular travelers.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

Traffic dynamics in a bi-modal transportation network with information provision and adaptive transit services

This paper has two major components. The first one is the day-to-day evolution of travelers’ mode and route choices in a bi-modal transportation system where traffic information (predicted travel cost) is available to travelers. The second one is a public transit operator adjusting or adapting its service over time (from period to period) based on observed system conditions. Particularly, we consider that on each day both travelers’ past travel experiences and the predicted travel cost (based on information provision) can affect travelers’ perceptions of different modes and routes, and thus affect their mode choice and/or route choice accordingly. This evolution process from day to day is formulated by a discrete dynamical model. The properties of such a dynamical model are then analyzed, including the existence, uniqueness and stability of the fixed point. Most importantly, we show that the predicted travel cost based on information provision may help stabilize the dynamical system even if it is not fully accurate. Given the day-to-day traffic evolution, we then model an adaptive transit operator who can adjust frequency and fare for public transit from period to period (each period contains a certain number of days). The adaptive frequency and fare in one period are determined from the realized transit demands and transit profits of the previous periods, which is to achieve a (locally) maximum transit profit. The day-to-day and period-to-period models and their properties are also illustrated by numerical experiments.     

Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach

This paper proposes a unified approach to modeling heterogonous risk-taking behavior in route choice based on the theory of stochastic dominance (SD). Specifically, the first-, second-, and third-order stochastic dominance (FSD, SSD, TSD) are respectively linked to insatiability, risk-aversion and ruin-aversion within the framework of utility maximization. The paths that may be selected by travelers of different risk-taking preferences can be obtained from the corresponding SD-admissible paths, which can be generated using general dynamic programming. This paper also analyzes the relationship between the SD-based approach and other route choice models that consider risk-taking behavior. These route choice models employ a variety of reliability indexes, which often make the problem of finding optimal paths intractable. We show that the optimal paths with respect to these reliability indexes often belong to one of the three SD-admissible path sets. This finding offers not only an interpretation of risk-taking behavior consistent with the SD theory for these route choice models, but also a unified and computationally viable solution approach through SD-admissible path sets, which are usually small and can be generated without having to enumerate all paths. A generic label-correcting algorithm is proposed to generate FSD-, SSD-, and TSD-admissible paths, and numerical experiments are conducted to test the algorithm and to verify the analytical results.     

Expanding the applicability of random regret minimization for route choice analysis

The discrete choice paradigm of random regret minimization (RRM) has been recently proposed in several choice contexts. In the route choice context, the paradigm has been used to model the choice among three routes and to formulate regret-based stochastic user equilibrium. However, in the same context the RRM literature has not confronted three major challenges: (i) accounting for similarities across alternative routes, (ii) analyzing choice set composition effects on choice probabilities, and (iii) comparing RRM-based models with advanced RUM-based models. This paper looks into RRM-based route choice models from these three perspectives by (i) proposing utility-based and regret-based correction terms to account for similarities across alternatives, (ii) analyzing the variation of choice set probabilities with the choice set composition, and (iii) comparing RRM-based route choice models with C-Logit, Path Size Logit and Paired Combinatorial Logit. The results illustrate the definition of the correction terms within the regret function, the effect of the choice set specificity of RRM-based route choice models, and the positive performance of these models when compared to advanced RUM-based models.     

Validating the results of a route choice simulator

This paper describes the validation of a route choice simulator known as VLADIMIR (Variable Legend Assessment Device for Interactive Measurement of Individual Route choice). VLADIMIR is an interactive computer-based tool designed to study drivers’ route choice behaviour. It has been extensively used to obtain data on route choice in the presence of information sources such as Variable Message Signs or In-Car Navigation devices. The simulator uses a sequence of digitized photographs to portray a real network with junctions, links, landmarks and road signs. Subject drivers are invited to make journeys between specified origins and destinations under a range of travel scenarios, during which the simulator automatically records their route choices. This paper describes validation experiments carried out during the period Summer 1994 to Autumn 1995 and reports on the results obtained. Each experiment involved a comparison of routes selected in real life with those driven under simulated conditions in VLADIMIR. The analysis included investigation of the subjects’ own assessment of the realism of the VLADIMIR routes they had chosen, a comparison of models based on the real life routes with models based on VLADIMIR routes, and a statistical comparison of the two sets of routes. After an extensive series of data collection exercises and analyses, we have concluded that a well designed simulator is able to replicate real life route choices with a very high degree of detail and accuracy. Not only was VLADIMIR able to precisely replicate the route choices of drivers who were familiar with the network but it also appears capable of representing the kind of errors made and route choice strategies adopted by less familiar drivers. Furthermore, evidence is presented to suggest that it can accurately replicate route choice responses to roadside VMS information.     

The opening of the Amsterdam Ring Road

This paper presents the results of a major before-and-after study carried out to establish the short term effects of the removal of a severe bottleneck in the road network around Amsterdam. An important focus in the study was on measuring changes in the timing of travel, as well as changes in route choice, mode choice, destination choice and frequency of travel. The results of the study indicated that, in the short run, there was little or no change in mode choice, nor was there significant emergence of new induced trips. On the other hand, large shifts in time of travel as well as route choice were reported, emphasising the importance of alterations to the timing and routes of existing trips when congestion is relieved, and the need to consider the benefits these bring in evaluating the impact of any road investment.     

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.     

Route Choice Behaviour of Freeway Travellers Under Real-time Traffic Information Provision – Application of the Best Route and the Habitual Route Choice Mechanisms

Abstract

This paper investigates route choice behaviour on freeways between Taipei and Taichung in Taiwan under the provision of real-time traffic information. Two types of route choice selection rules (the best-route and habitual-route) are analysed using ordered probit models to identify the major influences on freeway travellers’ route choice behaviour. The level of service associated with each route is defined as a generalised cost saving (GCS) and specified non-linearly with a threshold inherent to travellers. The marginal (dis)utility thresholds in the ‘best’ and ‘habitual’ behaviour models are identified through a goodness-of-fit grid. The results confirm that the thresholds for changing the inertia behaviour of drivers should be larger than the ones for choosing the best routes. In addition, the drivers are more likely to choose either the best or the habitual routes once the GCS are greater than the identified threshold values.     

Development of a differential route share model for railroad freight traffic

This paper summarizes work undertaken towards development and calibration of a model to predict the distribution of rail freight traffic among competing routes. The model is designed for use in analyzing the traffic effects of changes in the level-of-service on selected rail lines. The model predicts route shares based on the overall network configuration of each railroad participating in a given market. The model selects feasible routes, discards those routes which appear to be too circuitous or costly, and then assigns traffic to the remaining routes in accordance with several network characteristics. It is designed to be sensitive to level-of-service changes, and to simulate the response of shippers and railroads to a competitive environment. A multiple route-finding algorithm was used to find possible routes based on the number of railroads operating at the originating and terminating end of a market. Multiple routes were determined and matched with observed traffic flows from the ICC One-Percent Waybill Sample. Physical network characteristics for each route, including distance, junction frequency, and “impedance,” were calculated from the network model and were correlated with the traffic share observed on each route in the market. A two-stage model was developed to find feasible routes from the set of possible routes and to allocate traffic to feasible routes based on levels-of-service. The model was calibrated on 9,793 routes from 1,199 markets with twenty or more carloads from the 1977 One-Percent Carload Waybill Sample. Model calibration supported the hypothesis that network route characteristics did indeed influence shipper choice of route, and that a normative model could be used to assess relative attractiveness of routes under various railroad corporate ownership restructuring scenarios.     

A path-size weibit stochastic user equilibrium model

The aim of this paper is to develop a path-size weibit (PSW) route choice model with an equivalent mathematical programming (MP) formulation under the stochastic user equilibrium (SUE) principle that can account for both route overlapping and route-specific perception variance problems. Specifically, the Weibull distributed random error term handles the identically distributed assumption such that the perception variance with respect to different trip lengths can be distinguished, and a path-size factor term is introduced to resolve the route overlapping issue by adjusting the choice probabilities for routes with strong couplings with other routes. A multiplicative Beckmann’s transformation (MBec) combined with an entropy term are used to develop the MP formulation for the PSW-SUE model. A path-based algorithm based on the partial linearization method is adopted for solving the PSW-SUE model. Numerical examples are also provided to illustrate features of the PSW-SUE model and its differences compared to some existing SUE models as well as its applicability on a real-size network.