Second best toll pricing within the framework of bounded rationality

The network design problem is usually formulated as a bi-level program, assuming the user equilibrium is attained in the lower level program. Given boundedly rational route choice behavior, the lower-level program is replaced with the boundedly rational user equilibria (BRUE). The network design problem with boundedly rational route choice behavior is understudied due to non-uniqueness of the BRUE. In this study, thus, we mainly focus on boundedly rational toll pricing (BR-TP) with affine link cost functions. The topological properties of the lower level BRUE set are first explored. As the BRUE solution is generally non-unique, urban planners cannot predict exactly which equilibrium flow pattern the transportation network will operate after a planning strategy is implemented. Due to the risk caused by uncertainty of people’s reaction, two extreme scenarios are considered: the traffic flow patterns with either the minimum system travel cost or the maximum, which is the “risk-prone” (BR-TP-RP) or the “risk-averse” (BR-TP-RA) scenario respectively. The upper level BR-TP is to find an optimal toll minimizing the total system travel cost, while the lower level is to find the best or the worst scenario. Accordingly BR-TP can be formulated as either a min –min or a min –max program. Solution existence is discussed based on the topological properties of the BRUE and algorithms are proposed. Two examples are accompanied to illustrate the proposed methodology.     

Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets

Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational behavior assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands. After defining ε-BRUE, where ε is the indifference band for the perceived travel cost, we formulate the ε-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE–NCP formulation. To obtain the BRUE solution set encompassing all BRUE flow patterns, we propose a methodology of generating acceptable path set which may be utilized under the boundedly rational behavior assumption. We show that with the increase of the indifference band, the acceptable path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference band to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. The BRUE solution set can then be obtained by assigning all traffic demands to the acceptable path set. Various numerical examples are given to illustrate our findings.     

Bounded rationality and irreversible network change

A network change is said to be irreversible if the initial network equilibrium cannot be restored by revoking the change. The phenomenon of irreversible network change has been observed in reality. To model this phenomenon, we develop a day-to-day dynamic model whose fixed point is a boundedly rational user equilibrium (BRUE) flow. Our BRUE based approach to modeling irreversible network change has two advantages over other methods based on Wardrop user equilibrium (UE) or stochastic user equilibrium (SUE). First, the existence of multiple network equilibria is necessary for modeling irreversible network change. Unlike UE or SUE, the BRUE multiple equilibria do not rely on non-separable link cost functions, which makes our model applicable to real-world large-scale networks, where well-calibrated non-separable link cost functions are generally not available. Second, travelers’ boundedly rational behavior in route choice is explicitly considered in our model. The proposed model is applied to the Twin Cities network to model the flow evolution during the collapse and reopening of the I-35 W Bridge. The results show that our model can to a reasonable level reproduce the observed phenomenon of irreversible network change.     

A discrete dynamical system of formulating traffic assignment: Revisiting Smith’s model

Through relaxing the behavior assumption adopted in Smith’s model (Smith, 1984), we propose a discrete dynamical system to formulate the day-to-day evolution process of traffic flows from a non-equilibrium state to an equilibrium state. Depending on certain preconditions, the equilibrium state can be equivalent to a Wardrop user equilibrium (UE), Logit-based stochastic user equilibrium (SUE), or boundedly rational user equilibrium (BRUE). These equivalence properties indicate that, to make day-to-day flows evolve to equilibrium flows, it is not necessary for travelers to choose their routes based on actual travel costs of the previous day. Day-to-day flows can still evolve to equilibrium flows provided that travelers choose their routes based on estimated travel costs which satisfy these preconditions. We also show that, under a more general assumption than the monotonicity of route cost function, the trajectory of the dynamical system converges to a set of equilibrium flows by reasonably setting these parameters in the dynamical system. Finally, numerical examples are presented to demonstrate the application and properties of the dynamical system. The study is helpful for understanding various processes of forming traffic jam and designing an algorithm for calculating equilibrium flows.     

Toll sequence operation to realize target flow pattern under bounded rationality

Because boundedly rational user equilibrium (BRUE) always has a set of solutions instead of a unique one, from a static network equilibrium viewpoint, under BRUE there is no guarantee of attainability of any specific target flow by implementing tolls. In this study, from a disequilibrium flow evolution perspective, we design toll sequence operations (TS-operations) to guide the network flow to evolve towards the traditional Wardrop user equilibrium (UE) flow pattern. Under homogeneous bounded rationality (BR), iteratively implementing our TS-operations can make the network flow pattern converge to UE, which essentially solves the nonuniqueness problem of BRUE and re-establishes the effectiveness of link tolls in realizing any target link flow pattern. In particular we show that under homogenous BR the best-case untolled link-based BRUE can be realized as the untolled equilibrium. Under heterogeneous BR among different OD pairs, our TS-operations can make the flow converge to reduced BRUE and/or sub-network UE, which give smaller estimate intervals of the equilibrium flow pattern as compared to the original BRUE.     

Formulating the within-day dynamic stochastic traffic assignment problem from a Bayesian perspective

This study proposes a formulation of the within-day dynamic stochastic traffic assignment problem. Considering the stochastic nature of route choice behavior, we treat the solution to the assignment problem as the conditional joint distribution of route traffic, given that the network is in dynamic stochastic user equilibrium. We acquire the conditional joint probability distribution using Bayes’ theorem. A Metropolis–Hastings sampling scheme is developed to estimate the characteristics (e.g., mean and variance) of the route traffic. The proposed formulation has no special requirements for the traffic flow models and user behavior models, and so is easily implemented.     

A day-to-day route flow evolution process towards the mixed equilibria

This study investigates a travelers’ day-to-day route flow evolution process under a predefined market penetration of advanced traveler information system (ATIS). It is assumed that some travelers equipped with ATIS will follow the deterministic user equilibrium route choice behavior due to the complete traffic information provided by ATIS, while the other travelers unequipped with ATIS will follow the stochastic user equilibrium route choice behavior. The interaction between these two groups of travelers will result in a mixed equilibrium state. We first propose a discrete day-to-day route flow adjustment process for this mixed equilibrium behavior by specifying the travelers’ route adjustment principle and adjustment ratio. The convergence of the proposed day-to-day flow dynamic model to the mixed equilibrium state is then rigorously demonstrated under certain assumptions upon route adjustment principle and adjustment ratio. In addition, without affecting the convergence of the proposed day-to-day flow dynamic model, the assumption concerning the adjustment ratio is further relaxed, thus making the proposed model more appealing in practice. Finally, numerical experiments are conducted to illustrate and evaluate the performance of the proposed day-to-day flow dynamic model.     

Modeling the charging and route choice behavior of BEV drivers

Due to the limited cruising range of battery electric vehicle (BEV), BEV drivers show obvious difference in travel behavior from gasoline vehicle (GV) drivers. To analyze BEV drivers’ charging and route choice behaviors, and extract the differences between BEV and GV drivers’ travel behavior, two multinomial logit-based and two nested logit-based models are proposed in this study based on a stated preference survey. The nested structure consists of two levels: the upper level represents the charging decision, and the lower level shows the route choices corresponding to the charging and no-charging situations respectively. The estimated results demonstrate that the nested structure is more appropriate than the multinomial structure. Meanwhile, it is observed that the initial state of charge (SOC) at origin of BEV is the most important factor that affects the decision of charging or not, and the SOC at destination becomes an important impact factor affecting BEV drivers’ route choice behavior. As for the route choice behavior when BEV has charging demand, the charging station attributes such as charging time and charging station’s location have significant influences on BEV drivers’ decision-making process. The results also show that BEV drivers incline to choose the routes with charging station having less charging time, being closer to origin and consistent with travel direction. Finally, based on the proposed models, a series of numerical analysis has been conducted to verify the effect of range anxiety on BEV charging and route choice behavior and to reveal the variation of comfortable initial SOC at origin with travel distance. Meanwhile, the effects of charging time and distance from origin to charging station also have been discussed.     

Equilibrium analysis and route guidance in large-scale networks with MFD dynamics

Recent studies have demonstrated that Macroscopic Fundamental Diagram (MFD), which provides an aggregated model of urban traffic dynamics linking network production and density, offers a new generation of real-time traffic management strategies to improve the network performance. However, the effect of route choice behavior on MFD modeling in case of heterogeneous urban networks is still unexplored. The paper advances in this direction by firstly extending two MFD-based traffic models with different granularity of vehicle accumulation state and route choice behavior aggregation. This configuration enables us to address limited traffic state observability and to scrutinize implications of drivers’ route choice in MFD modeling. We consider a city that is partitioned in a small number of large-size regions (aggregated model) where each region consists of medium-size sub-regions (more detailed model) exhibiting a well-defined MFD. This paper proposes a route guidance advisory control system based on the aggregated model as a large-scale traffic management strategy that utilizes aggregated traffic states while sub-regional information is partially known. In addition, we investigate the effect of equilibrium conditions (i.e. user equilibrium and system optimum) on the overall network performance, in particular MFD functions.     

Exploration of day-to-day route choice models by a virtual experiment

This paper examines existing day-to-day models based on a virtual day-to-day route choice experiment using the latest mobile Internet technologies. With the realized day-to-day path flows and path travel times in the experiment, we calibrate several well-designed path-based day-to-day models that take the Wardrop’s user equilibrium as (part of) their stationary states. The nonlinear effects of path flows and path time differences on path switching are then investigated. Participants’ path preferences, time-varying sensitivity, and learning behavior in the day-to-day process are also examined. The prediction power of various models with various settings (nonlinear effects, time-varying sensitivity, and learning) is compared. The assumption of “rational behavior adjustment process” in Yang and Zhang (2009) is further verified. Finally, evolutions of different Lyapunov functions used in the literature are plotted, and no obvious diversity is observed.     

The effect of travel time variability on route choice decision: a generalized linear mixed model based analysis

The effect of travel time variability (TTV) on route choice behavior is explored in this study. A stated preference survey is conducted to collect behavioral data on Shanghai drivers’ choice between a slow but stable route and a fast but unreliable route. Travel time and TTV are respectively measured by mean and standard deviation of random travel time. The generalized linear mixed model (GLMM) is applied to quantify trade-offs between travel time and TTV. The GLMM based route choice model effectively accounts for correlations among repeated observations from the same respondent, and captures heterogeneity in drivers’ values of TTV. Model estimation results show that, female drivers and drivers with rich driving experience are less likely to choose a route with high TTV; smaller expected travel time of a route increase the probability of its being chosen; all drivers have intrinsic preference for a route with smaller expected travel time, but the degree of preference may vary within the population; TTV on average has negative effects on route choice decision, but a small portion of drivers are risk-prone to choose a fast but unreliable route despite high TTV.     

A marginal utility day-to-day traffic evolution model based on one-step strategic thinking

Most deterministic day-to-day traffic evolution models, either in continuous-time or discrete-time space, have been formulated based on a fundamental assumption on driver route choice rationality where a driver seeks to maximize her/his marginal benefit defined as the difference between the perceived route costs. The notion of rationality entails the exploration of the marginal decision rule from economic theory, which states that a rational individual evaluates his/her marginal utility, defined as the difference between the marginal benefit and the marginal cost, of each incremental decision. Seeking to analyze the marginal decision rule in the modeling of deterministic day-to-day traffic evolution, this paper proposes a modeling framework which introduces a term to capture the marginal cost to the driver induced by route switching. The proposed framework enables to capture both benefit and cost associated with route changes. The marginal cost is then formulated upon the assumption that drivers are able to predict other drivers’ responses to the current traffic conditions, which is adopted based on the notion of strategic thinking of rational players developed in behavior game theory. The marginal cost based on 1-step strategic thinking also describes the “shadow price” of shifting routes, which helps to explain the behavioral tendency of the driver perceiving the cost-sensitivity to link/route flows. After developing a formulation of the marginal utility day-to-day model, its theoretical properties are analyzed, including the invariance property, asymptotic stability, and relationship with the rational behavioral adjustment process.     

Boundedly rational route choice behavior: A review of models and methodologies

Perfect rationality (PR) has been widely used in modeling travel behavior. As opposed to PR, bounded rationality (BR) has recently regained researchers’ attention since it was first introduced into transportation science in the 1980s due to its power in more realistic travel behavior modeling and prediction. This paper provides a comprehensive survey on the models of BR route choice behavior, aiming to identify current research gaps and provide directions for future research. Despite a small but growing body of studies on employing bounded rationality principle, BR route choice behavior remains understudied due to the following reasons: (a) The existence of BR thresholds leads to mathematically intractable properties of equilibria; (b) BR parameters are usually latent and difficult to identify and estimate; and (c) BR is associated with human being’s cognitive process and is challenging to model. Accordingly, we will review how existing literature addresses the aforementioned challenges in substantive and procedural bounded rationality models. Substantive bounded rationality models focus on choice outcomes while procedural bounded rationality models focus on the empirical studies of choice processes. Bounded rationality models in each category can be further divided based on whether time dimension is included. Accordingly, static and dynamic traffic assignment are introduced in substantive bounded rationality while two-stage cognitive models and day-to-day learning models in procedural bounded rationality are discussed. The methodologies employed in substantive bounded rationality include game theory and interactive congestion game, while those in procedural bounded rationality mainly adopt random utility and non- or semi-compensatory models. A comparison of all existing methodologies are given and bounded rationality models’ scope and boundaries in terms of predictability, transferability, tractability, and scalability are discussed. Finally existing research gaps are presented and several promising future research directions are given.     

Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach

This paper studies a mean-standard deviation shortest path model, also called travel time budget (TTB) model. A route’s TTB is defined as this route’s mean travel time plus a travel time margin, which is the route travel time’s standard deviation multiplied with a factor. The TTB model violates the Bellman’s Principle of Optimality (BPO), making it difficult to solve it in any large stochastic and time-dependent network. Moreover, it is found that if path travel time distributions are skewed, the conventional TTB model cannot reflect travelers’ heterogeneous risk-taking behavior in route choice. This paper proposes to use the upper or lower semi-standard deviation to replace the standard deviation in the conventional TTB model (the new models are called derived TTB models), because these derived TTB models can well capture such heterogeneous risk-taking behavior when the path travel time distributions are skewed. More importantly, this paper shows that the optimal solutions of these two derived TTB models must be non-dominated paths under some specific stochastic dominance (SD) rules. These finding opens the door to solve these derived TTB models efficiently in large stochastic and time-dependent networks. Numerical examples are presented to illustrate these findings.     

A portfolio theory of route choice

Although many individual route choice models have been proposed to incorporate travel time variability as a decision factor, they are typically still deterministic in the sense that the optimal strategy requires choosing one particular route that maximizes utility. In contrast, this study introduces an individual route choice model where choosing a portfolio of routes instead of a single route is the best strategy for a rational traveler who cares about both journey time and lateness when facing stochastic network conditions. The proposed model is compared with UE and SUE models and the difference in both behavioral foundation and model characteristics is highlighted. A numerical example is introduced to demonstrate how such model can be used in traffic assignment problem. The model is then tested with GPS data collected in metropolitan Minneapolis–St. Paul, Minnesota. Our data suggest there is no single dominant route (defined here as a route with the shortest travel time for a 15 day period) in 18% of cases when links travel times are correlated. This paper demonstrates that choosing a portfolio of routes could be the rational choice of a traveler who wants to optimize route decisions under variability.     

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.     

Dynamic traffic routing in a network with adaptive signal control

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this research, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. It is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.     

Investigating the effect of travel time variability on drivers' route choice decisions in Shanghai,China

Abstract

This paper investigates the effect of travel time variability on drivers' route choice behavior in the context of Shanghai, China. A stated preference survey is conducted to collect drivers' hypothetical choice between two alternative routes with designated unequal travel time and travel time variability. A binary choice model is developed to quantify trade-offs between travel time and travel time variability across various types of drivers. In the model, travel time and travel time variability are, respectively, measured by expectation and standard deviation of random travel time. The model shows that travel time and travel time variability on a route exert similarly negative effects on drivers' route choice behavior. In particular, it is found that middle-age drivers are more sensitive to travel time variability and less likely to choose a route with travel time uncertainty than younger and elder drivers. In addition, it is shown that taxi drivers are more sensitive to travel time and more inclined to choose a route with less travel time. Drivers with rich driving experience are less likely to choose a route with travel time uncertainty.     

Day-to-day traffic dynamics considering social interaction: From individual route choice behavior to a network flow model

Social interaction is increasingly recognized as an important factor that influences travelers’ behaviors. It remains challenging to incorporate its effect into travel choice behaviors, although there has been some research into this area. Considering random interaction among travelers, we model travelers’ day-to-day route choice under the uncertain traffic condition. We further explore the evolution of network flow based on the individual-level route choice model, though that travelers are heterogeneous in decision-making under the random-interaction scheme. We analyze and prove the existence of equilibrium and the stability of equilibrium. We also analyzed and described the specific properties of the network flow evolution and travelers’ behaviors. Two interesting phenomena are found in this study. First, the number of travelers that an individual interacts with can affect his route choice strategy. However, the interaction count exerts no influence on the evolution of network flow at the aggregate-level. Second, when the network flow reaches equilibrium, the route choice strategy at the individual-level is not necessarily invariable. Finally, two networks are used as numerical examples to show model properties and to demonstrate the two study phenomena. This study improves the understanding of travelers’ route choice dynamics and informs how the network flow evolves under the influence of social interaction.     

Context-dependent influence of road attributes and pricing policies on route choice behavior of truck drivers: results of a conjoint choice experiment

In this paper, we report the results of a stated choice experiment, which was conducted to examine truck drivers?? route choice behavior. Of particular interest are the questions (i) what is the relative importance of road accessibility considerations via-a-vis traditional factors influencing route choice behavior, (ii) what are the influences of particular personal and situational variables on the evaluation of route attributes, (iii) how sensitive are truck drivers for possible pricing policies, and (iv) is there a difference in impact if environmental concerns are framed as a bonus or as a pricing instrument. The main findings indicate that road accessibility characteristics have a substantial impact on route preferences which is of the same order of magnitude as variation in travel times. This suggests that provision of adequate travel information in itself can be an effective instrument to prevent negative externalities of good transport associated with shortest routes. Furthermore, the results indicate that truck drivers/route planners when choosing a route are relatively sensitive to road pricing schemes and rather insensitive to environmental bonuses.