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.     

A dynamic stochastic assignment model for the analysis of general networks

The paper adopts the framework employed by the existing dynamic assignment models, which analyse specific network forms, and develops a methodology for analysing general networks. Traffic conditions within a link are assumed to be homogeneous, and the time varying O-D travel times and traffic flow patterns are calculated using elementary relationships from traffic flow theory and link volume conservation equations. Each individual is assumed to select a departure time and a route by trading off the travel time and schedule delay associated with each alternative. A route is considered as reasonable if it includes only links which do not take the traveller back to the origin. The set of reasonable routes is not consistant but depends on the time that an individual decides to depart from his origin. Equilibrium distributions are derived from a Markovian model which describes the evolution of travel patterns from day to day. Numerical simulation experiments are conducted to analyse the impact of different work start time flexibilities on the time dependent travel patterns. The similarity between link flows and travel times obtained from static and dynamic stochastic assignment is investigated. It is shown that in congested networks the application of static assignment results in travel times which are lower than the ones predicted by dynamic assignment.     

Reliable route guidance: A case study from Chicago

Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5-15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.     

Adaptive traffic signal control with equilibrium constraints under stochastic demand

This study develops a methodology to model transportation network design with signal settings in the presence of demand uncertainty. It is assumed that the total travel demand consists of commuters and infrequent travellers. The commuter travel demand is deterministic, whereas the demand of infrequent travellers is stochastic. Variations in demand contribute to travel time uncertainty and affect commuters’ route choice behaviour. In this paper, we first introduce an equilibrium flow model that takes account of uncertain demand. A two-stage stochastic program is then proposed to formulate the network signal design under demand uncertainty. The optimal control policy derived under the two-stage stochastic program is able to (1) optimize the steady-state network performance in the long run, and (2) respond to short-term demand variations. In the first stage, a base signal control plan with a buffer against variability is introduced to control the equilibrium flow pattern and the resulting steady-state performance. In the second stage, after realizations of the random demand, recourse decisions of adaptive signal settings are determined to address the occasional demand overflows, so as to avoid transient congestion. The overall objective is to minimize the expected total travel time. To solve the two-stage stochastic program, a concept of service reliability associated with the control buffer is introduced. A reliability-based gradient projection algorithm is then developed. Numerical examples are performed to illustrate the properties of the proposed control method as well as its capability of optimizing steady-state performance while adaptively responding to changing traffic flows. Comparison results show that the proposed method exhibits advantages over the traditional mean-value approach in improving network expected total travel times.     

A stochastic transit assignment model using a dynamic schedule-based network

Using the schedule-based approach, in which scheduled time-tables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost which consists of four components: in-vehicle time; waiting time; walking time; and a time penalty for each line change. With the exception of in-vehicle time, each of the other cost components is weighted by a sensitivity coefficient which varies among travelers and is defined by a density function. This time-dependent and stochastic minimum path is generated by a specially developed branch and bound algorithm. The assignment procedure is conducted over a period in which both passenger demand and train headways are varying. Due to the stochastic nature of the assignment problem, a Monte Carlo approach is employed to solve the problem. A case study using the Mass Transit Railway System in Hong Kong is given to demonstrate the model and its potential applications.     

Path finding under uncertainty

Path finding problems have many real‐world applications in various fields, such as operations research, computer science, telecommunication, transportation, etc. In this paper, we examine three definitions of optimality for finding the optimal path under an uncertain environment. These three stochastic path finding models are formulated as the expected value model, dependent‐chance model, and chance‐constrained model using different criteria to hedge against the travel time uncertainty. A simulation‐based genetic algorithm procedure is developed to solve these path finding models under uncertainties. Numerical results are also presented to demonstrate the features of these stochastic path finding models.     

Consistent formulation of network equilibrium with stochastic flows

Traffic flows in real-life transportation systems vary on a daily basis. According to traffic flow theory, such variability should induce a similar variability in travel times, but this “internal consistency” is generally not captured by existing network equilibrium models. We present an internally-consistent network equilibrium approach, which considers two potential sources of flow variability: (i) daily variation in route choice and (ii) daily variation in origin–destination demand. We particularly aspire to a flexible formulation that permits alternative statistical assumptions, which allows the best fit to be made to observed variability data in particular applications. Joint probability distributions of route—and therefore link—flows are derived under several assumptions concerning stochastic driver behavior. A stochastic network equilibrium model with stochastic demands and route choices is formulated as a fixed point problem. We explore limiting cases which allow an equivalent convex optimization problem to be defined, and finally apply this method to a real-life network of Kanazawa City, Japan.     

First-best marginal cost toll for a traffic network with stochastic demand

First-best marginal cost pricing (MCP) in traffic networks has been extensively studied with the assumption of deterministic travel demand. However, this assumption may not be realistic as a transportation network is exposed to various uncertainties. This paper investigates MCP in a traffic network under stochastic travel demand. Cases of both fixed and elastic demand are considered. In the fixed demand case, travel demand is represented as a random variable, whereas in the elastic demand case, a pre-specified random variable is introduced into the demand function. The paper also considers a set of assumptions of traveler behavior. In the first case, it is assumed that the traveler considers only the mean travel time in the route choice decision (risk-neutral behavior), and in the second, both the mean and the variance of travel time are introduced into the route choice model (risk-averse behavior). A closed-form formulation of the true marginal cost toll for the stochastic network (SN-MCP) is derived from the variational inequality conditions of the system optimum and user equilibrium assignments. The key finding is that the calculation of the SN-MCP model cannot be made by simply substituting related terms in the original MCP model by their expected values. The paper provides a general function of SN-MCP and derives the closed-form SN-MCP formulation for specific cases with lognormal and normal stochastic travel demand. Four numerical examples are explored to compare network performance under the SN-MCP and other toll regimes.     

The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.     

Dynamic stochastic journey time estimation and reliability analysis using stochastic cell transmission model: Algorithm and case studies

This paper proposes a framework for evaluating the distributions of stochastic dynamic link travel time and journey time as well as assessing the journey time reliability. Due to the stochastic nature of the flow profiles, the paper devises a sampling process to estimate the probability mass function (PMF) of the link travel time. This sampling process defines a likelihood concept that measures the probability of the difference between the cumulative stochastic link inflow and outflow profiles to be less than or equal to a prescribed bound. Based on this likelihood measure, the probability mass function (PMF) of the link travel time is evaluated over an appropriate sampling interval. The PMF of the journey time is then evaluated by extending the deterministic nested delay operator to a stochastic version which is defined as a series of “nested” conditional probabilities of the link travel time PMFs along the route. This paper also proposes a method to fit the PMF of the journey time to a class of statistical distribution to determine its skewness, which is useful in the analysis of journey time reliability. The paper then analyzes journey time reliability via the properties of dynamic travel time distributions such as confidence intervals and shape parameters. The proposed algorithm is applied to estimate the stochastic journey time on a freeway corridor from the stochastic cumulative inflow and outflow profiles generated from the stochastic cell transmission model. This methodology is validated with two empirical studies: (i) estimations of journey time distribution and reliability analysis for one short freeway segment in California during a specific time period and (ii) the effects of traffic incidents on journey time reliability for a long expressway corridor of Hanshin expressway (between Osaka and Kobe) in Japan.     

New technology and the modeling of risk-taking behavior in congested road networks

Intelligent transport systems provide various means to improve traffic congestion in road networks. Evaluation of the benefits of these improvements requires consideration of commuters’ response to reliability and/or uncertainty of travel time under various circumstances. Various disruptions cause recurrent or non-recurrent congestion on road networks, which make road travel times intrinsically fluctuating and unpredictable. Confronted with such uncertain traffic conditions, commuters are known to develop some simple decision-making process to adjust their travel choices. This paper represents the decision-making process involved in departure-time and route choices as risk-taking behavior under uncertainty. An expected travel disutility function associated with commuters’ departure-time and route choices is formulated with taking into account the travel delay (due the recurrent congestion), the uncertainty of travel times (due to incident-induced congestion) and the consequent early or late arrival penalty. Commuters are assumed to make decision on the departure-time and route choices on the basis of the minimal expected travel disutility. Thus the network will achieve a simultaneous route and departure-time user equilibrium, in which no commuter can decrease his or her expected disutility by unilaterally changing the route or departure-time. The equilibrium is further formulated as an equivalent nonlinear complementarity problem and is then converted into an unconstrained minimization problem with the use of a gap function suggested recently. Two algorithms based on the Nelder–Mead multidimensional simplex method and the heuristic route/time-swapping approach, are adapted to solve the problem. Finally, numerical example is given to illustrate the application of the proposed model and algorithms.     

Modeling the evolutions of day‐to‐day route choice and year‐to‐year ATIS adoption with stochastic user equilibrium

Suppose that in an urban transportation network there is a specific advanced traveler information system (ATIS) which acts for reducing the drivers' travel time uncertainty through provision of pre‐trip route information. Because of the imperfect information provided, some travelers are not in compliance with the ATIS advice although equipped with the device. We thus divide all travelers into three groups, one group unequipped with ATIS, another group equipped and in compliance with ATIS advice and the third group equipped but without compliance with the advice. Each traveler makes route choice in a logit‐based manner and a stochastic user equilibrium with multiple user classes is reached for every day. In this paper, we propose a model to investigate the evolutions of daily path travel time, daily ATIS compliance rate and yearly ATIS adoption, in which the equilibrium for every day's route choice is kept. The stability of the evolution model is initially analyzed. Numerical results obtained from a test network are presented for demonstrating the model's ability in depicting the day‐to‐day and year‐to‐year evolutions.     

Assessing the effects of stochastic perception error under travel time variability

Perceived mean-excess travel time is a new risk-averse route choice criterion recently proposed to simultaneously consider both stochastic perception error and travel time variability when making route choice decisions under uncertainty. The stochastic perception error is conditionally dependent on the actual travel time distribution, which is different from the deterministic perception error used in the traditional logit model. In this paper, we investigate the effects of stochastic perception error at three levels: (1) individual perceived travel time distribution and its connection to the classification by types of travelers and trip purposes, (2) route choice decisions (in terms of equilibrium flows and perceived mean-excess travel times), and (3) network performance measure (in terms of the total travel time distribution and its statistics). In all three levels, a curve fitting method is adopted to estimate the whole distribution of interest. Numerical examples are also provided to illustrate and visualize the above analyses. The graphical illustrations allow for intuitive interpretation of the effects of stochastic perception error at different levels. The analysis results could enhance the understanding of route choice behaviors under both (subjective) stochastic perception error and (objective) travel time uncertainty. Some suggestions are also provided for behavior data collection and behavioral modeling.     

A copula-based approach for estimating the travel time reliability of urban arterial

Estimating the travel time reliability (TTR) of urban arterial is critical for real-time and reliable route guidance and provides theoretical bases and technical support for sophisticated traffic management and control. The state-of-art procedures for arterial TTR estimation usually assume that path travel time follows a certain distribution, with less consideration about segment correlations. However, the conventional approach is usually unrealistic because an important feature of urban arterial is the dependent structure of travel times on continuous segments. In this study, a copula-based approach that incorporates the stochastic characteristics of segments travel time is proposed to model arterial travel time distribution (TTD), which serves as a basis for TTR quantification. First, segments correlation is empirically analyzed and different types of copula models are examined. Then, fitting marginal distributions for segment TTD is conducted by parametric and non-parametric regression analysis, respectively. Based on the estimated parameters of the models, the best-fitting copula is determined in terms of the goodness-of-fit tests. Last, the model is examined at two study sites with AVI data and NGSIM trajectory data, respectively. The results of path TTD estimation demonstrate the advantage of the proposed copula-based approach, compared with the convolution model without capturing segments correlation and the empirical distribution fitting methods. Furthermore, when considering the segments correlation effect, it was found that the estimated path TTR is more accurate than that by the convolution model.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

Comparative analysis of three user equilibrium models under stochastic demand

Recent empirical studies on the value of time and reliability reveal that travel time variability plays an important role on travelers' route choice decision process. It can be considered as a risk to travelers making a trip. Therefore, travelers are not only interested in saving their travel time but also in reducing their risk. Typically, risk can be represented by two different aspects: acceptable risk and unacceptable risk. Acceptable risk refers to the reliability aspect of acceptable travel time, which is defined as the average travel time plus the acceptable additional time (or buffer time) needed to ensure more frequent on‐time arrivals, while unacceptable risk refers to the unreliability aspect of unacceptable late arrivals (though infrequent) that have a travel time excessively higher than the acceptable travel time. Most research in the network equilibrium based approach to modeling travel time variability ignores the unreliability aspect of unacceptable late arrivals. This paper examines the effects of both reliability and unreliability aspects in a network equilibrium framework. Specifically, the traditional user equilibrium model, the demand driven travel time reliability‐based user equilibrium model, and the α‐reliable mean‐excess travel time user equilibrium model are considered in the investigation under an uncertain environment due to stochastic travel demand. Numerical results are presented to examine how these models handle risk under travel time variability.     

Accounting for stochastic variables in discrete choice models

The estimation of discrete choice models requires measuring the attributes describing the alternatives within each individual’s choice set. Even though some attributes are intrinsically stochastic (e.g. travel times) or are subject to non-negligible measurement errors (e.g. waiting times), they are usually assumed fixed and deterministic. Indeed, even an accurate measurement can be biased as it might differ from the original (experienced) value perceived by the individual.Experimental evidence suggests that discrepancies between the values measured by the modeller and experienced by the individuals can lead to incorrect parameter estimates. On the other hand, there is an important trade-off between data quality and collection costs. This paper explores the inclusion of stochastic variables in discrete choice models through an econometric analysis that allows identifying the most suitable specifications. Various model specifications were experimentally tested using synthetic data; comparisons included tests for unbiased parameter estimation and computation of marginal rates of substitution. Model specifications were also tested using a real case databank featuring two travel time measurements, associated with different levels of accuracy.Results show that in most cases an error components model can effectively deal with stochastic variables. A random coefficients model can only effectively deal with stochastic variables when their randomness is directly proportional to the value of the attribute. Another interesting result is the presence of confounding effects that are very difficult, if not impossible, to isolate when more flexible models are used to capture stochastic variations. Due the presence of confounding effects when estimating flexible models, the estimated parameters should be carefully analysed to avoid misinterpretations. Also, as in previous misspecification tests reported in the literature, the Multinomial Logit model proves to be quite robust for estimating marginal rates of substitution, especially when models are estimated with large samples.     

A reliability-based assignment method for railway networks with heterogeneous passengers

Travel reliability can play an important role in shaping travelers’ route choice behavior. This paper develops a railway passenger assignment method to capture the reliability-based route choices, where the trains can have stochastic delays. The overall travel reliability has two components: the travel time reliability (of trains) and the associated transfer reliability (of connections). In this context, mean-and-variance-based effective travel cost is adopted to model passengers’ evaluation of different travel options in the railway network. Moreover, passengers are heterogeneous as they may evaluate the effective travel cost differently, and they may have different requirements for the successful transfer probability (if transfers are involved in the trip). The determination of travel time reliability (of trains) is based on the travel delay distribution, and the successful transfer probability is calculated based on the delay probabilities of two trains in the transfer process. An algorithm has been designed for solving the model, and numerical examples are presented to test and illustrate the model.     

Modeling absolute and relative cost differences in stochastic user equilibrium problem

This paper aims to develop a hybrid closed-form route choice model and the corresponding stochastic user equilibrium (SUE) to alleviate the drawbacks of both Logit and Weibit models by simultaneously considering absolute cost difference and relative cost difference in travelers’ route choice decisions. The model development is based on an observation that the issues of absolute and relative cost differences are analogous to the negative exponential and power impedance functions of the trip distribution gravity model. Some theoretical properties of the hybrid model are also examined, such as the probability relationship among the three models, independence from irrelevant alternatives, and direct and indirect elasticities. To consider the congestion effect, we provide a unified modeling framework to formulate the Logit, Weibit and hybrid SUE models with the same entropy maximization objective but with different total cost constraint specifications representing the modelers’ knowledge of the system. With this, there are two ways to interpret the dual variable associated with the cost constraint: shadow price representing the marginal change in the entropy level to a marginal change in the total cost, and dispersion/shape parameter representing the travelers’ perceptions of travel costs. To further consider the route overlapping effect, a path-size factor is incorporated into the hybrid SUE model. Numerical examples are also provided to illustrate the capability of the hybrid model in handling both absolute and relative cost differences as well as the route overlapping problem in travelers’ route choice decisions.     

A microscopic analysis of speed deviation impacts on lane-changing behavior

Driving behavior models that capture drivers’ tactical maneuvering decisions in different traffic conditions are essential to microscopic traffic simulation systems. This paper focuses on a parameter that has a great impact on road users’ aggressive overtaking maneuvers and directly affects lane-changing models (an integral part of microscopic traffic simulation models), namely, speed deviation. The objective of this research is to investigate the impacts of speed deviation in terms of performance measures (delay time, network mean speed, and travel time duration) and the number of lane-change maneuvers using the Aimsun traffic simulator. Following calibration of the model for a section of urban highway in Tehran, this paper explores the sensitivity of lane-changing maneuvers during different speed deviations by conducting two types of test. Simulation results show that, by decreasing speed deviation, the number of lane changes reduces remarkably and so network safety increases, thus reducing travel time due to an increase in network mean speed.