Next Article in Journal
Does Digitalization Benefit Employees? A Systematic Meta-Analysis of the Digital Technology–Employee Nexus in the Workplace
Next Article in Special Issue
Analysis of the Impact for Mixed Traffic Flow Based on the Time-Varying Model Predictive Control
Previous Article in Journal
Toward Resilient Implementation of Land Degradation Neutrality via Systemic Approaches
Previous Article in Special Issue
Human Digital Healthcare Engineering for Enhancing the Health and Well-Being of Seafarers and Offshore Workers: A Comprehensive Review
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Effect of Pre-Trip Information in a Traffic Network with Stochastic Travel Conditions: Role of Risk Attitude

1
Beijing Transport Institute, Fengtai District, Beijing 100071, China
2
School of Systems Science, Beijing Jiaotong University, Beijing 100044, China
3
School of Civil and Transportation Engineering, Ningbo University of Technology, Ningbo 315211, China
4
Zhejiang Engineering Research Center of Digital Road Construction Technology, Ningbo 315211, China
*
Author to whom correspondence should be addressed.
Systems 2025, 13(6), 407; https://doi.org/10.3390/systems13060407
Submission received: 3 April 2025 / Revised: 19 May 2025 / Accepted: 22 May 2025 / Published: 24 May 2025

Abstract

Empirical studies have suggested that travelers’ risk attitudes affect their choice behavior when travel conditions are stochastic. By considering the travelers’ risk attitudes, we extend the classical two-route model, in which road capacities vary due to such shocks as bad weather, accidents, and special events. Two information regimes have been investigated. In the zero-information regime, we postulate that travelers acquire the variability in route travel time based on past experiences and choose the route to minimize the travel time budget. In the full-information regime, travelers have pre-trip information of the road capacities and thus choose the route to minimize the travel time. User equilibrium states of the two regimes have been analyzed, based on the canonical BPR travel time function with power coefficient p . In the special case p = 1 , the closed form solutions have been derived. Three cases and eleven subcases have been classified concerning the dependence of expected total travel times on the risk attitude in the zero-information regime. In the general condition p > 0 , although we are not able to derive the closed form solutions, we proved that the results are qualitatively unchanged. We have studied the benefit gains/losses by shifting from the zero-information to the full-information regime. The circumstance under which pre-trip information is beneficial has been identified. A numerical analysis is conducted to further illustrate the theoretical findings.

1. Introduction

Transportation system dynamics are fundamentally shaped by traffic demand and travelers’ choice behavior, encompassing transportation mode selection, departure scheduling, and route planning. This intrinsic relationship underscores the critical importance of understanding commuter behavioral mechanisms for effective system management and optimization. Among numerous behavioral determinants, the role of information provision has emerged as a pivotal research focus in transportation studies.
Historically, traffic information dissemination relied on conventional media channels, including print publications, broadcast systems, and dynamic signage. The technological evolution has witnessed the proliferation of Advanced Traveler Information Systems (ATISs) [1,2,3,4,5,6,7], integrating multimodal data streams through digital platforms such as navigation applications, mobile devices, and personalized travel assistants [8,9,10,11]. Such real-time data provisions empower travelers to optimize their mobility strategies across multiple dimensions—from parking location selection to itinerary customization—aimed at minimizing individual travel disutility [12,13,14,15,16,17,18,19]. While empirical evidence suggests potential societal benefits through enhanced network efficiency [20,21,22,23], contrasting findings reveal an “information paradox”, where excessive information provision paradoxically degrades system performance. This counterintuitive phenomenon manifests through three primary mechanisms: concentration, overreaction, and oversaturation [13]. Notably, Emmerink et al. demonstrated how amplified congestion levels could emerge from disproportionate user reactions to traffic alerts [24]. Subsequent studies by Verhoef et al. and Emmerink et al. further identified scenarios where expanded informational access precipitated network-wide performance deterioration [25,26]. Acemoglu et al. found that the informational Braess’s Paradox can occur in a network congestion game, where commuters with access to information about alternative routes paradoxically experience worse outcomes than those lacking such information [27].
In particular, Lindsey et al. conducted seminal research on the classical “two-route network”, analyzing pre-trip information efficacy under stochastic travel conditions [28]. Their model compares two information regimes: zero-information and full-information regimes. In the zero-information regime, travelers only know the unconditional probability distribution of traffic conditions on the two routes, while in the other regime, they are provided the road conditions before choosing a route. Travelers are assumed to be risk-neutral with respect to travel times, so that they prefer the route with a lower expected travel cost in their model. They found that information can have a negative impact on social welfare when travel cost functions on the two routes are quadratic. By contrast, when capacities vary independently and travel cost functions are linear, pre-trip information is always welfare-improving. Complementary experimental work by Rapoport et al. validated these theoretical predictions through observed behavioral patterns [6].
However, emerging empirical evidence challenges the risk-neutrality assumption, highlighting the significant role of risk perception in shaping travelers’ route selection strategies [29,30]. In response to these behavioral observations, transportation researchers have developed sophisticated equilibrium models to analyze risk-adaptive behaviors in network performance scenarios [31,32,33,34,35]. Lo et al. introduced an innovative travel time budget (TTB) framework that incorporates historical variability data into commuters’ decision-making processes, formulating a multi-class equilibrium model to simulate the route choice behaviors of risk-averse travelers [36,37]. Parallel developments include Yin et al.’s expected disutility paradigm that quantifies risk-taking behavior [38]. Recent theoretical advancements by Tan et al. have systematically compared the Pareto efficiency of various reliability-based equilibrium states, employing statistical descriptors of the central tendency and dispersion for network performance assessment [39]. Li studied heterogeneous risk preferences through a revealed preference analysis. They found differences in the willingness to pay for time savings and reduced travel time variability [40].
As mentioned above, most scholars have employed equilibrium analysis and empirical research methods to analyze risk-adaptive behaviors in network performance scenarios. However, there is still a lack of detailed theoretical analysis on the impact of pre-trip information and travelers’ risk attitudes on travel choice behaviors.
In this study, we extend the model proposed by Lindsey et al. to consider travelers’ risk attitudes. We postulate that travelers acquire the variability in route travel time based on past experiences and choose the route to minimize the travel time budget in the zero-information regime. We study the welfare gains or losses by shifting from the zero-information to the full-information regime. Using the canonical BPR travel time function with power coefficient p, user equilibrium states of the two regimes are analyzed. In the special case p = 1, the closed form solutions have been derived. Three cases and eleven subcases have been classified concerning the dependence of expected total travel times on the risk attitude in the zero-information regime. In the general condition p > 0, the travel time function is not linear. Although we are not able to derive the closed form solutions, we proved that the results are qualitatively unchanged. We have studied the benefit gains/losses by shifting from the zero-information to the full-information regime. The circumstance under which pre-trip information is beneficial has been identified. Finally, a numerical analysis is conducted to further illustrate the theoretical findings.
The rest of this paper is organized as follows. Section 2 gives a brief introduction to the model. Section 3 derives the closed form user equilibrium solutions in the special case p = 1 and discusses the general condition p > 0. Section 4 studies welfare gains or losses from information. The numerical examples are presented in Section 5 to further illustrate the theoretical findings. The conclusion is given in Section 6.

2. The Model

The notations used in the paper are listed in Table 1.
Consider the classical “two-route network” model as shown in Figure 1, in which a single origin (O) is connected to a single destination (D) by two routes. The traffic demand is fixed at Q . Assuming constant demand in a commuting corridor is justified, as we consider a long-run equilibrium, and the volume of daily commuters generally exhibits minimal fluctuation over a long period. Travel conditions on each route vary from day to day because of bad weather, accidents, roadwork, or other shocks. The state of the route, denoted as s , is random and drawn from the set S = G , B , where G and B represent the good (normal) and bad (incident) conditions, respectively. The traffic demand on route i is denoted as Q i . The travel time on route i when it is in state s is assumed to follow the canonical U.S. Bureau of Public Roads form [41],
T i s Q i = a i + b i s Q i p , p 0 , i = 1,2 , s .
Let a i denote the free-flow travel time on route i . Parameter b i s represents the stochastic congestion coefficient on route i , and p is the power coefficient. For simplicity, we do not consider the situation that a i can also change in a stochastic way.
Following existing studies, we adopt the following assumptions in our model:
Assumption 1. 
Travel conditions on each route are either good ( G ) or bad ( B ), with  b i B > b i G .
In contrast to the deterministic bottleneck model, we consider a bottleneck capacity by two distinct operational states: good ( G ) and bad ( B ), varying from day to day due to random factors (e.g., traffic incidents, construction activities), with probabilities π for the bad state and 1 π for the good state. The assumed binary capacity model is practical. For instance, a two-lane road operates at full capacity without accidents but loses half its capacity if a lane is blocked by an accident.
Assumption 2. 
Without loss of generality, assume  b 1 B / b 1 G < b 2 B / b 2 G .
Assumption 3. 
The congestion coefficients  b 1 s  and  b 2 s  are statistically independent.
Th ratio b i B / b i G quantifies the congestion elasticity, indicating the proportional increase in congestion due to incidents relative to baseline conditions. Assumption 2 indicates that route 1 exhibits less significant congestion growth compared to route 2 under the same incident severity. This higher reliability may stem from road designs, such as emergency shoulders or parallel arterials, which reduce b 1 B by limiting bottleneck formations. Assumption 3 guarantees that special incidents occur stochastically on each route. When a pair of routes are geographically separated and disruptions like accidents occur on one of the two routes, the capacity of the other route can remain the designed capacity. Such a separation allows parameters b 1 s and b 2 s to exhibit statistical independence.
Route capacity degradations can cause route travel time variability. Travelers do not know their exact a priori travel time without pre-trip information. As Lo et al. proposed, in the presence of travel condition variations, to hedge against uncertainty, travelers generally add or deduct a travel time margin to the expected trip time to form their travel time budget [3]. The travel time budget depends on the risk attitudes of the travelers and also on the trip purposes. For trips that have a high penalty for lateness, such as trips to job interviews or trips to the airport to catch a flight, one can expect that travelers can be risk-averse and reserve a larger travel time budget. The travel time budget is defined as
T r a v e l   T i m e   B u d g e t = E x p e c t e d   T r a v e l   T i m e + T r a v e l   T i m e   M a r g i n .
Mathematically, the travel time budget on route i , B i , can be expressed as
B i = E T i + λ V a r T i ,
where T i is the random variable of travel time on route i ; E T i and V a r T i are the mean and variance of T i , respectively; and λ is the risk-preference coefficient. The risk-averse travelers with λ > 0 will reserve a relatively large travel time budget; the risk-preferred travelers with λ < 0 will reserve a relatively small travel time budget. For λ = 0 , travelers are risk-neutral.

3. User Equilibrium

In this section, two information regimes are considered: zero-information ( Z ) and full-information ( F ) regimes. Travelers are assumed to adopt pure strategies and follow the user equilibrium (UE) principle so that they choose a route deterministically. Three scenarios (A–C) and seven situations (i–vii) are studied in this section.

3.1. User Equilibrium in the Zero-Information Regime

In the zero-information regime, travelers only know the unconditional probability distribution of conditions on the route (i.e., the probability of a bad condition ( B ) occurring is π , and the probability of a good condition ( G ) occurring is 1 π ), but do not know the specific congestion state of the two routes on each day. Travelers are assumed to prefer the route with lower travel time budget. Let Q i Z denote the traffic demand on route i in the zero-information regime. The expected travel time on route i can be written as
E T i Z = π T i B Q i Z + 1 π T i G Q i Z = a i + ε i Q i Z p ,
in which ε i = π b i B + 1 π b i G . Then, the expected total travel time on the network can be calculated
E T T Z = Q 1 Z E T 1 Z + Q 2 Z E T 2 Z = ε 1 Q 1 Z p + 1 + ε 2 Q Q 1 Z p + 1 + a 1 a 2 Q 1 Z + a 2 Q .
Similarly, the expectation of T i Z 2 can be written as
E [ T i Z 2 ] = π [ T i B Q i Z ] 2 + 1 π [ T i G Q i Z ] 2 = π a i + b i B Q i Z p 2 + 1 π a i + b i G Q i Z p 2 .
Thus, the variance in travel time can be obtained,
V a r T i Z = E [ T i Z 2 ] [ E T i Z ] 2 = π 1 π b i B b i G 2 Q i Z 2 p .
The travel time budget of route i , B i Z is a function of Q i Z , and can be written as
B i Z Q i Z = E T i Z + λ V a r T i Z = a i + k i Q i Z p ,
in which k i = ε i + λ b i B b i G π 1 π .
Let f λ , Q 1 Z = B 1 Z Q 1 Z B 2 Z Q 1 Z denote a composite function of λ and Q 1 Z ; then, the following can be obtained:
f λ , Q 1 Z = a 1 a 2 + ε 1 + λ b 1 B b 1 G π 1 π Q 1 Z p ε 2 + λ b 2 B b 2 G π 1 π Q Q 1 Z p .
The user equilibrium (UE) is realized when the travel time budget on the two routes is equal, i.e.,
f λ , Q 1 Z = 0 .

3.1.1. Three Scenarios Under p = 1

Given p = 1 , one can see that the function of B i Z versus Q i Z is a linear function. Equation (8) can be simplified into
B 1 Z Q 1 Z = a 1 + k 1 Q 1 Z ,   a n d
B 2 Z Q 1 Z = a 2 + k 2 Q 2 Z = a 2 + k 2 Q k 2 Q 1 Z .
Then, the equation f λ , Q 1 Z = 0 has a unique solution, unless k 1 = k 2 . In this case, the solution can be denoted as
Q 1 Z = Q ¯ 1 Z = a 2 a 1 + ε 2 Q + λ b 2 B b 2 G Q π 1 π ε 1 + ε 2 + λ b 1 B b 1 G + b 2 B b 2 G π 1 π .
Note that from Equation (13), one can easily derive that the solution Q ¯ 1 Z is a constant when λ ± , no matter which situation it is. We denote it as [ Q 1 Z ] # ,
Q ¯ 1 Z = [ Q 1 Z ] # = b 2 B b 2 G Q / b 1 B b 1 G + b 2 B b 2 G ,
and it is obvious that 0 < [ Q 1 Z ] # < Q .
As a result, there are three scenarios under p = 1 , i.e., scenario A–C, which are classified based on the relationship between k 1 and k 2 . Under each scenario, there are different possible UE patterns, denoted as pattern ij, where i = A, B, C and j = 1, 2 …, which are classified due to the possibilities of λ .
  • Scenario A: k 1 = k 2
We can derive that scenario A exists when
λ = λ 0 = ε 1 + ε 2 / b 1 B b 1 G + b 2 B b 2 G π 1 π
by solving k 1 = k 2 . In this scenario, functions B 1 Z Q 1 Z and B 2 Z Q 1 Z are parallel (or identical) to each other. One has k 1 = b 1 G b 2 B b 1 B b 2 G / b 1 B b 1 G + b 2 B b 2 G by substituting λ = λ 0 into k 1 . One can easily derive that k 1 > 0 , since b 1 B / b 1 G < b 2 B / b 2 G (Assumption 2). As a result, in this scenario, there are three possible UE patterns, as shown in Figure 2 and Table 2.
2.
Scenario B: k 1 k 2 and k 1 k 2 0
By solving k 1 k 2 and k 1 k 2 0 , we can derive that scenario B exists when λ λ 1 , λ 0 λ 0 , λ 2 . Here, λ 1 and λ 2 can be obtained by solving k 1 = 0 and k 2 = 0 , separately,
λ 1 = ε 1 / b 1 B b 1 G π 1 π λ 2 = ε 2 / b 2 B b 2 G π 1 π .
In this scenario, the equation f λ , Q 1 Z = 0 has a unique solution, Q 1 Z = Q ¯ 1 Z , as shown in Equation (13). Substituting λ = λ 1 into k 1 , one has k 1 = 0 . Since k 1 is an increasing function of λ , one has k 1 0 in scenario B. Accordingly, k 2 0 . Therefore, the slopes of functions B 1 Z Q 1 Z and B 2 Z Q 1 Z have the same sign. As a result, in this scenario, there are six possible patterns, as shown in Figure 3 and Table 3.
3.
Scenario C: k 1 k 2 and k 1 k 2 > 0
Obviously, scenario C exists when λ < λ 1 or λ > λ 2 . In this scenario, the equation f λ , Q 1 Z = 0 has a unique solution, as shown in Equation (13), and the slopes of functions B 1 Z Q 1 Z and B 2 Z Q 1 Z have a different sign. As a result, in this scenario, there are six possible UE patterns, as shown in Figure 4 and Table 4.

3.1.2. Closed Form UE Solutions Under p = 1

In this section, we first discuss the relation between Q 1 Z and λ in the zero-information regime based on the above patterns in the three scenarios. By setting Q ¯ 1 Z = 0 and Q ¯ 1 Z = Q , respectively, we obtain two thresholds:
λ 3 = a 1 a 2 ε 2 Q / b 2 B b 2 G Q π 1 π λ 4 = a 2 a 1 ε 1 Q / b 1 B b 1 G Q π 1 π .
Note that λ 3 > λ 4 when a 2 a 1 < ϕ , and λ 3 < λ 4 when a 2 a 1 > ϕ . Here,
ϕ = b 1 G b 2 B b 1 B b 2 G Q / b 1 B b 1 G + b 2 B b 2 G ,
by solving λ 3 = λ 4 . Due to Assumption 2, it is obvious that ϕ > 0 . Moreover, the other two thresholds of a 2 a 1 can be obtained by solving λ 2 = λ 4 and λ 1 = λ 3 , respectively,
φ = b 1 G b 2 B b 1 B b 2 G Q / b 2 B b 2 G ϖ = b 1 G b 2 B b 1 B b 2 G Q / b 1 B b 1 G .
In the special case a 2 a 1 = ϕ , Q ¯ 1 Z in Equation (13) is a constant no matter what the risk attitude λ is (see Figure 5c). We denote the constant Q ¯ 1 Z as [ Q 1 Z ] ,
Q ¯ 1 Z = [ Q 1 Z ] = b 2 B b 2 G Q / b 1 B b 1 G + b 2 B b 2 G .
If a 2 a 1 ϕ , the function (13) of Q ¯ 1 Z versus λ is a hyperbolic curve. When a 2 a 1 < ϕ , the function is an increasing one for the two branches (see Figure 5a,b); when a 2 a 1 > ϕ , the function is a decreasing one for the two branches (see Figure 5d–g). Note that the two branches are separated by λ = λ 0 . From Equation (13), Q ¯ 1 Z can be less than 0 or larger than Q ; however, 0 Q 1 Z Q should be met.
According to the above analysis, under UE, seven situations are given based on the relationship of a 1 and a 2 , and different scenarios may belong to one of the situations.
1.
Situations (i) and (ii)
When a 2 a 1 < ϕ , situations (i) and (ii) can exist. In the two situations, when λ = λ 0 , pattern A2 exists, in which all travelers choose route 2 under UE.
  • Situation (i) corresponds to λ 4 < λ 1 and λ 2 < λ 3 (see Figure 5a). In this situation, patterns C1, C2, B2, B6, C6, and C4 exist when the risk attitude λ belongs to , λ 4 , λ 4 , λ 1 , λ 1 , λ 0 , λ 0 , λ 2 , λ 2 , λ 3 , and λ 3 , + , respectively.
  • Situation (ii) corresponds to λ 1 < λ 4 and λ 3 < λ 2 (see Figure 5b). In this situation, patterns C1, B1, B2, B6, B4, and C4 exist when λ belongs to , λ 1 , λ 1 , λ 4 , λ 4 , λ 0 , λ 0 , λ 3 , λ 3 , λ 2 , and λ 2 , + , respectively.
  • Note that when a 2 a 1 < ϕ , λ 2 < λ 3 , and λ 1 < λ 4 cannot be not met simultaneously, λ 2 > λ 3 and λ 1 > λ 4 cannot be not met simultaneously, either.
2.
Situation (iii)
When a 2 a 1 = ϕ , one has situation (iii). In this situation, when λ = λ 0 , pattern A1 exists, in which Q 1 Z is not uniquely determined under UE, which can be any value between 0 and Q ( 0 Q 1 Z Q ). Moreover, patterns C1, B1, B4, and C4 exist when λ belongs to , λ 1 , λ 1 , λ 0 , λ 0 , λ 2 , and λ 2 , + , respectively (see Figure 5c).
3.
Situations (iv)–(vii)
When a 2 a 1 > ϕ , situations (iv), (v), or (vi), and (vii) can exist. In the four situations, when λ = λ 0 , pattern A3 exists, in which all travelers choose route 1 under UE.
  • Situation (iv) corresponds to λ 1 < λ 3 and λ 4 < λ 2 (see Figure 5d). In this situation, patterns C1, B1, B3, B5, B4, and C4 exist when λ belongs to , λ 1 , λ 1 , λ 3 , λ 3 , λ 0 , λ 0 , λ 4 , λ 4 , λ 2 , and λ 2 , + , respectively.
  • Situation (v) corresponds to λ 1 < λ 3 and λ 2 < λ 4 (see Figure 5e). In this situation, patterns C1, B1, B3, B5, C5, and C4 exist when λ belongs to , λ 1 , λ 1 , λ 3 , λ 3 , λ 0 , λ 0 , λ 2 , λ 2 , λ 4 , and λ 4 , + , respectively.
  • Situation (vi) corresponds to λ 3 < λ 1 and λ 4 < λ 2 (see Figure 5f). In this situation, patterns C1, C3, B3, B5, B4, and C4 exist when λ belongs to , λ 3 , λ 3 , λ 1 , λ 1 , λ 0 , λ 0 , λ 4 , λ 4 , λ 2 , and λ 2 , + , respectively.
  • Situation (vii) corresponds to λ 3 < λ 1 and λ 2 < λ 4 (see Figure 5g). In this situation, patterns C1, C3, B3, B5, C5, and C4 exist when λ belongs to , λ 3 , λ 3 , λ 1 , λ 1 , λ 0 , λ 0 , λ 2 , λ 2 , λ 4 , and λ 4 , + , respectively.
The boundary conditions for the seven possible situations are shown in Table 5. One can see that the existence conditions of situation (vi) and (v) are mutually exclusive. In other words, with other parameters fixed, when a 2 a 1 increases from to + , while situations (i)–(iv) and (vii) can always be observed, either situation (v) or situation (vi) can emerge.
If we only concern the relation between Q 1 Z and λ , and do not care for the specific scenario, then the seven situations can be attributed to three cases.
Case 1 includes situation (i) and (ii), in which Q 1 Z = 0 or Q 1 Z = Q when λ < λ 4 ; Q 1 Z = 0 when λ 4 < λ < λ 3 ; and Q 1 Z = Q ¯ 1 Z when λ > λ 3 .
Case 2 includes situation (iii), in which Q 1 Z = 0 or Q 1 Z = Q when λ < λ 0 ; 0 Q 1 Z Q when λ = λ 0 ; and Q 1 Z = [ Q 1 Z ] when λ > λ 0 .
Case 3 includes situation (iv)-(vii), in which Q 1 Z = 0 or Q 1 Z = Q when λ < λ 3 ; Q 1 Z = Q when λ 3 < λ < λ 4 ; and Q 1 Z = Q ¯ 1 Z when λ > λ 4 .
Now we investigate the relation between E [ T T Z ] and λ based on the three cases. Note that from Equation (5), the expected total travel time, E [ T T Z ] , is a quadratic function of Q 1 Z under p = 1 , and reaches a minimum value when
Q 1 Z = [ Q 1 Z ] = a 2 a 1 + 2 ε 2 Q / 2 ε 1 + 2 ε 2 ,
which corresponds to
λ 5 = a 2 a 1 ε 1 + ε 2 [ a 2 a 1 b 1 B + b 2 B b 1 G b 2 G 2 b 1 G b 2 B b 1 B b 2 G Q ] π 1 π .
Obviously, [ Q 1 Z ] may be less than 0 or greater than Q ; however, 0 Q 1 Z Q should be met. Substituting Q 1 Z = 0 , Q 1 Z = Q and Q 1 Z = [ Q 1 Z ] # into Equation (5), respectively, one has three critical values of expected total travel time,
E 0 = E T T z Q 1 Z = 0 = a 2 Q + ε 2 Q 2 E Q = E T T z Q 1 Z = Q = a 1 Q + ε 1 Q 2 E # = E [ T T z ] ( Q 1 Z = [ Q 1 Z ] # ) = a 1 b 2 B b 2 G + b 1 B b 1 G a 2 + ε 2 Q Q b 1 B b 1 G + b 2 B b 2 G + b 2 B b 2 G b 1 G b 2 B b 1 B b 2 G Q 2 b 1 B b 1 G + b 2 B b 2 G 2 .
By setting E 0 = E Q , one has
a 2 a 1 = ψ = ε 1 ε 2 Q .
Moreover, based on the three critical values, we have the following thresholds of risk coefficient λ ,
λ 6 = ε 2 ε 1 + ε 2 Q b 1 G b 2 B b 1 B b 2 G Q a 2 a 1 + ε 2 Q b 1 B b 1 G + b 2 B b 2 G π 1 π λ 7 = ε 1 ε 1 + ε 2 Q a 2 a 1 ε 1 Q b 1 B b 1 G + b 2 B b 2 G b 1 G b 2 B b 1 B b 2 G Q π 1 π λ 8 = b 1 G b 2 B b 1 B b 2 G ε 1 + ε 2 Q b 1 B b 1 G + b 2 B b 2 G a 2 a 1 b 1 B b 1 G + b 2 B b 2 G 2 b 1 G b 2 B b 1 B b 2 G Q π 1 π ,
by solving E T T z = E 0 , E T T z = E Q , and E T T z = E # , respectively.
As a result, the three cases can be classified into eleven subcases (see Figure 6, Figure 7 and Figure 8 and Table 6).
  • Case 1 in Figure 6a–d: When a 2 a 1 < ϕ , case 1 exists. One can easily prove that E # < E Q and λ 3 > λ 4 are always met in case 1. Case 1 can be further classified into cases 1a–1d.
In case 1a, λ 3 > λ 5 and E 0 < E # < E Q . In this subcase, E [ T T Z ] increases with λ when λ λ 3 , + ; there are two possible UE states when λ , λ 4 , and E [ T T Z ] is a constant when λ ( λ 4 , λ 3 ) (see Figure 6a).
In case 1b–1d, λ 3 < λ 5 . The three subcases correspond to E 0 < E # < E Q , E # < E 0 < E Q , and E # < E Q < E 0 , respectively. In the three subcases, E [ T T Z ] increases with λ when λ λ 5 , + and decreases with λ when λ λ 3 , λ 5 ; there are two possible UE states when λ , λ 4 , and E [ T T Z ] is a constant when λ ( λ 4 , λ 3 ) ; E [ T T Z ] reaches the minimum value when λ = λ 5 (see Figure 6b–d).
  • Case 2 in Figure 7: When a 2 a 1 = ϕ , case 2 exists. One can easily prove that E # < m i n E 0 , E Q and λ 0 = λ 3 = λ 4 are always met in case 2. In this case, there are two possible UE states when λ , λ 0 ; the expected total travel time E [ T T Z ] is not uniquely determined when λ = λ 0 , which can be any value between E and m a x E 0 , E Q . Here,
    E = E [ T T z ] ( Q 1 Z = Q 1 Z ] ,
    which denotes the minimum value of the expected total travel time. Note that 0 [ Q 1 Z ] Q is met due to E # < m i n E 0 , E Q . Finally, E [ T T Z ] is a constant no matter what the risk attitude is when λ λ 0 , + , which can be calculated,
    E T T z = b 2 B b 2 G a 1 + ϕ + b 1 B b 1 G a 2 + ε 2 Q Q / b 1 B b 1 G + b 2 B b 2 G .
  • Case 3 in Figure 8a–f: When a 2 a 1 > ϕ , case 3 exists. One can easily prove that E # < E 0 and λ 3 < λ 4 are always met in case 3. Case 3 can be further classified into cases 3a–3f.
In case 3a and case 3b, λ 5 < λ 3 . The two subcases correspond to E # < E 0 < E Q and E # < E Q < E 0 , respectively (see Figure 8a,b). In the two subcases, E [ T T Z ] decreases with λ when λ λ 4 , + ; there are two possible UE states when λ , λ 3 , and E [ T T Z ] is a constant when λ λ 3 , λ 4 .
In case 3c–3e, λ 5 > λ 4 . The three subcases correspond to E # < E 0 < E Q , E # < E Q < E 0 , and E Q < E # < E 0 , respectively (see Figure 8c–e). In the three subcases, E [ T T Z ] decreases with λ when λ λ 4 , λ 5 , and increases with λ when λ λ 5 , + ; there are two possible UE states when λ , λ 3 , and E [ T T Z ] is a constant when λ λ 3 , λ 4 ; E [ T T Z ] reaches the minimum value when λ = λ 5 .
In case 3f, λ 3 < λ 5 < λ 4 and E Q < E # < E 0 (see Figure 8f). E [ T T Z ] increases with λ when λ 4 , + ; there are two possible UE states when λ , λ 3 , and E [ T T Z ] is a constant when λ λ 3 , λ 4 .
Actually, with other parameters fixed, not all 11 subcases can be observed when a 2 a 1 increases from to + . For example, when ψ < ϕ , case 3a and case 3c do not exist; when ϕ < ψ < 2 ϕ , case 1d and case 3c do not exist; and when ψ > 2 ϕ , case 1d and case 3b do not exist (see Table 6). This will be further illustrated in numerical examples in Section 5.

3.1.3. General Results Under p > 0

In the zero-information regime, we have derived the closed form solutions under p = 1 in the above subsection. However, the equation f λ , Q 1 Z = 0 does not have closed form solutions for arbitrary p ( p > 0 and p 1 ) if the free-flow travel times are different (i.e., a 1 a 2 ). Nevertheless, we can prove that the results are qualitatively unchanged.
For arbitrary p ( p > 0 ), denote the solution of equation f λ , Q 1 Z = 0 for a given λ as Q 1 Z = Q ^ 1 Z , and assume that the slopes of functions B 1 Z Q 1 Z and B 2 Z Q 1 Z under the solution are
k 1 = p k 1 Q ^ 1 Z p 1 k 2 = p k 2 Q Q ^ 1 Z p 1 .
It is obvious that the state Q 1 Z = Q ^ 1 Z is not a UE state when Q ^ 1 Z < 0 or Q ^ 1 Z > Q , because 0 Q 1 Z Q should be met. Based on the definition of the UE principle, we have the following property.
Property 1. 
Assume that the state  Q 1 Z = Q ^ 1 Z  satisfies  0 Q ^ 1 Z Q . Then the following is obtained:
(a) 
when  k 1 = k 2 , if the functions  B 1 Z Q 1 Z  and  B 2 Z Q 1 Z  are identical, the state is a UE state; otherwise, the two functions are a tangent at  Q 1 Z = Q ^ 1 Z , which is not a UE state, unless  Q 1 Z = 0  (if  B 1 Z Q 1 Z  is above  B 2 Z Q 1 Z ) or  Q 1 Z = Q  (if  B 1 Z Q 1 Z  is below  B 2 Z Q 1 Z );
(b) 
when  k 1 < k 2 , the state is not a UE state;
(c) 
when  k 1 > k 2 , the state is a UE state.
By substituting Q 1 Z = 0 and Q 1 Z = Q into equation f λ , Q 1 Z = 0 , respectively, one has
λ 3 = a 1 a 2 ε 2 Q p / b 2 B b 2 G Q p π 1 π λ 4 = a 2 a 1 ε 1 Q p / b 1 B b 1 G Q p π 1 π .
By solving λ 3 = λ 4 , one has
a 2 a 1 = ϕ = b 1 G b 2 B b 1 B b 2 G Q p / b 1 B b 1 G + b 2 B b 2 G .
As a result, we have the following propositions.
Proposition 1. 
When  λ + , the traffic demand  Q 1 Z  under UE is a constant no matter what  a 2 a 1  is.
Proof. 
Substituting  λ + into the UE condition f λ , Q 1 Z = 0 , one can easily derive that the solution is
Q 1 Z = [ Q 1 Z ] # # = Q / 1 + b 1 B b 1 G / b 2 B b 2 G p ,
which is a constant independent of a 2 a 1 . When λ + , one has k 1 > 0 . Moreover, k 2 < 0 is always met, provided 0 < Q 1 Z < Q . Thus, f λ , Q 1 Z Q 1 Z = k 1 k 2 > 0 . Thereby, the solution is unique. According to Property 1(c), the state Q 1 Z = [ Q 1 Z ] # # is a unique UE state. □
Proposition 2. 
(a) 
when  a 2 a 1 < ϕ , there are two possible UE states ( Q 1 Z = 0  or  Q 1 Z = Q ) when  λ < λ 4 . Otherwise, a unique UE state exists:  Q 1 Z = 0  when  λ 4 < λ < λ 3 ;  0 Q 1 Z < [ Q 1 Z ] # #  and  Q 1 Z  increases with  λ  when  λ > λ 3 ;
(b) 
when  a 2 a 1 = ϕ , there are two possible UE states ( Q 1 Z = 0  or  Q 1 Z = Q ) when  λ < λ 3 ; the UE traffic demand  Q 1 Z  is not uniquely determined, which can be any value between 0 and  Q  ( 0 Q 1 Z Q ) when  λ = λ 3 ; the UE traffic demand is a constant  Q 1 Z = [ Q 1 Z ] # #  when  λ > λ 3 ;
(c) 
when  a 2 a 1 > ϕ , there are two possible UE states ( Q 1 Z = 0  or  Q 1 Z = Q ) when  λ < λ 3 . Otherwise, a unique UE state exists:  Q 1 Z = Q  when  λ 3 < λ < λ 4 ;  [ Q 1 Z ] # # < Q 1 Z Q ; and  Q 1 Z  decreases with  λ  when  λ > λ 4 .
Proof. 
The proof of the proposition can be found in Appendix A1. □
Proposition 3. 
The function of  E T T Z  versus λ has at most one extreme point.
Proof. 
The proof of the proposition can be found in Appendix A2. □
Proposition 2 is consistent with the three cases of the relation between  Q 1 Z and λ under p = 1 . The result of Proposition 3 is consistent with that of the 11 subcases under p = 1 , in which there is no extreme point in cases 1a, 2, 3a, 3b and 3f, and one extreme point exists at   λ = λ 5 in other cases. Given the three propositions, one can conclude that the results under the general condition ( p > 0 ) are qualitatively unchanged as that under p = 1 .

3.2. User Equilibrium in the Full-Information Regime

In the full-information regime, travelers can be informed about the accurate travel conditions before choosing a route and thus choose the route to minimize the travel time. Given Assumption 3, there are four possible combinations for the system: G G , B G , G B , and B B , where the first letter refers to the condition of route 1, and the second refers to the condition of route 2 as shown in Figure 9. Accordingly, there are four possible UE usage levels of route i : Q i G G F , Q i G B F , Q i B G F , and Q i B B F . The expected total travel time on the network E [ T T F ] can be calculated by
E [ T T F ] = 1 π 2 T T G G F + 1 π π T T G B F + π 1 π T T B G F + π 2 T T B B F ,
in which T T s s F denotes the total travel time on the network when route 1 is in state s and route 2 is in state s , s , s S = G , B ,
T T s s F = Q 1 s s F T 1 s Q 1 s s F + Q 2 s s F T 2 s Q 2 s s F
With full information, the UE division of traffic between routes is realized when the travel time is equal, i.e., g Q 1 s s F = 0 ; here,
g Q 1 s s F = T 1 s Q 1 s s F T 2 s Q 2 s s F = a 1 a 2 + b 1 s Q 1 s s F p b 2 s Q Q 1 s s F p .
Given p = 1 , substituting Equation (1) into g Q 1 s s F = 0 , the UE traffic demand on route 1 can be obtained,
Q 1 G G F = m a x 0 , m i n a 2 a 1 + b 2 G Q b 1 G + b 2 G , Q Q 1 G B F = m a x 0 , m i n a 2 a 1 + b 2 B Q b 1 G + b 2 B , Q Q 1 B G F = m a x 0 , m i n a 2 a 1 + b 2 G Q b 1 B + b 2 G , Q Q 1 B B F = m a x 0 , m i n a 2 a 1 + b 2 B Q b 1 B + b 2 B , Q .
and one has Q 2 s s F = Q Q 1 s s F , s , s S .
In the full-information regime, for arbitrary p ( p > 0 ), denote the solution of g Q 1 s s F = 0 as Q 1 s s F = Q ^ 1 s s F ; then, we have the following proposition.
Proposition 4. 
In the full-information regime, there is a unique UE state for each combination  s s , and
(a) 
when  a 2 a 1 b 2 s Q p , all travelers choose route 2 under UE (i.e.,  Q 1 s s F = 0 );
(b) 
when  b 2 s Q p < a 2 a 1 < b 1 s Q p , the UE state is  Q 1 s s F = Q ^ 1 s s F  ( 0 < Q ^ 1 s s F < Q );
(c) 
when  a 2 a 1 b 1 s Q p , all travelers choose route 1 under UE (i.e.,  Q 1 s s F = Q ).
Proof. 
The proof of the proposition can be found in Appendix A3. □

4. Welfare Gains or Losses from Information

In this section, we study the welfare gains/losses from pre-trip information. We compare the expected total travel time between the zero-information and full-information regimes. The welfare gains/losses under equilibrium by shifting from the zero-information to full-information regimes are
G Z F = E [ T T Z ] E [ T T F ] .
Welfare improvement is defined as G Z F 0 . G Z F < 0 corresponds to the information paradox.
Proposition 5. 
For the general condition ( p > 0 ), full information is always welfare-improving under the UE state  Q 1 Z = 0  or  Q 1 Z = Q .
Proof. 
The proof of the proposition can be found in Appendix A4. □
Proposition 5 indicates that providing pre-trip information is of vital importance to avoid the overuse of one route that arises from uncertainty. In the zero-information regime, if most travelers are risk-averse, they may all end up choosing the same route. This is an outcome we obviously wish to avoid. This homogeneity occurs because risk-averse travelers tend to be more cautious, and they allocate more time to travel and prefer stable, predictable routes over accident-prone, unreliable ones. To mitigate this inefficiency, it is prudent to provide accurate pre-trip information via intelligent transportation systems, diverting a portion of travelers to less-used routes. Such strategic guidance can significantly enhance the transportation network’s operational efficiency and improve overall travel quality. Based on proposition 5, we have the following corollaries.
Corollary 1. 
In case 1a and case 3f, full information is always welfare-improving.
Proof. 
In case 1a, the minimum of  E [ T T Z ] is achieved when Q 1 Z = 0 . In case 3f, the minimum of E [ T T Z ] is achieved when Q 1 Z = Q . According to proposition 5, one has G Z F 0 . □
By denoting λ 6 and λ 7 as the two critical values of λ by solving E [ T T Z ] = E 0 and E [ T T Z ] = E Q under p > 0 , respectively, we have the following corollary.
Corollary 2. 
Full information is welfare-improving, if one of the following cases occurs in the zero-information regime:
(a) 
when  λ < λ 3  in either case 1c or case 2;
(b) 
when  λ < λ 4  in either case 3b or case 3d;
(c) 
when  λ < λ 6  in either case 3a or case 3c;
(d) 
when  λ < λ 7  in case 1d;
(e) 
when  λ < λ 3  or  λ > λ 6  in case 1b;
(f) 
when  λ < λ 4  or  λ > λ 7  in case 3e.
Proof. 
In the above-mentioned range of  λ , E [ T T Z ] is not smaller than either E 0 or E Q . According to Proposition 5, one has G Z F 0 . □
Since risk attitudes affect travelers’ route choice behavior and therefore welfare gain, next, we compare the welfare gain of risk-neutral travelers with that of risk-preferred ones and risk-averse ones. Since there is no closed form solution in the general condition ( p > 0 ), we focus on the special condition ( p = 1 ).
Proposition 6. 
In case 1a and case 3f, risk-neutral travelers obtain no more welfare gains than risk-preferred ones or risk-averse ones.
Proof. 
In case 1a, from  a 2 a 1 < 2 ε 2 Q , one can derive λ 3 > 0 . In case 3f, from a 2 a 1 > 2 ε 1 Q , one can derive λ 4 > 0 . Since E T T Z reaches the minimum when λ < λ 3 in case 1a and when λ < λ 4 in case 3f, risk-neutral travelers can obtain a minimum welfare gain. □
Proposition 7. 
In case 2, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude  λ < λ 0 .
Proof. 
In case 2,  E # = E [ T T Z ] λ = 0 < m i n E 0 , E Q (see Figure 7). Thus, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude λ < λ 0 . □
Proposition 8. 
(a) 
In case 3a and case 3c, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude  λ < λ 6 ;
(b) 
In case 1d, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude  λ < λ 7 .
Proof. 
In case 3a and case 3c, from  ϕ < a 2 a 1 < ψ , one can derive λ 6 < 0 . Thus, one can easily prove that E 0 = E [ T T Z ] λ = λ 6 > E [ T T Z ] λ = 0 is always met in the two cases. Therefore, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude λ < λ 6 (see Figure 8a,c).
In case 1d, from ψ < a 2 a 1 < ϕ , one can derive λ 7 < 0 . Thus, one can easily prove that E Q = E [ T T Z ] λ = λ 7 > E [ T T Z ] λ = 0 is always met in this case. Therefore, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude λ < λ 7 (see Figure 6d). □
Proposition 9. 
(a) 
In case 1b, risk-neutral travelers obtain no more welfare gains than risk-averse ones with risk attitude  λ > λ 6 ;
(b) 
In case 3e, risk-neutral travelers obtain no more welfare gains than risk-averse ones with risk attitude  λ > λ 7 .
Proof. 
In case 1b, from  2 ε 2 Q < a 2 a 1 < ϕ ε 2 Q , one can derive λ 6 > 0 . Thus, one can easily prove that E 0 = E [ T T Z ] λ = λ 6 > E [ T T Z ] λ = 0 is always met in this case. Therefore, risk-neutral travelers obtain no more welfare gains than risk-averse ones with risk attitude λ > λ 6 (see Figure 6b).
In case 3e, from ϕ + ε 1 Q < a 2 a 1 < 2 ε 1 Q , one can derive λ 7 > 0 . Thus, one can easily prove that E Q = E [ T T Z ] λ = λ 7 > E [ T T Z ] λ = 0 is always met in this case. Therefore, risk-neutral travelers obtain no more welfare gains than risk-averse ones with risk attitude λ > λ 7 (see Figure 8e). □
Proposition 10. 
(a) 
In case 3c and case 3d, risk-neutral travelers obtain more welfare gains than risk-averse ones with risk attitude  λ > λ 8 ;
(b) 
In case 3e, risk-neutral travelers obtain more welfare gains than risk-averse ones with risk attitude  λ 4 < λ < λ 7 .
Proof. 
In case 3c and case 3d, from  a 2 a 1 > 2 ϕ , one can derive λ 8 > 0 . Thus, one can easily prove that E # = E [ T T Z ] λ = λ 8 < E [ T T Z ] λ = 0 is always met in these two cases (see Figure 8c,d). Therefore, risk-neutral travelers obtain more welfare gains than risk-averse ones with risk attitude λ > λ 8 .
In case 3e, from ϕ + ε 1 Q < a 2 a 1 < 2 ε 1 Q , one can derive λ 4 > 0 . Thus, one can easily prove that E Q = E [ T T Z ] λ = λ 4 = E [ T T Z ] λ = λ 7 < E [ T T Z ] λ = 0 is always met in this case (see Figure 8e). Therefore, risk-neutral travelers obtain more welfare gains than risk-averse ones with risk attitude λ 4 < λ < λ 7 . □
Propositions 6–10 indicate that risk-neutral travelers sometimes obtain less (or larger) welfare gains. The assumption that travelers are risk-neutral may underestimate or overestimate the benefit gains or losses of the information. As demonstrated in Propositions 6–9, risk-preferred and risk-averse travelers may exhibit a stronger preference for choosing specific routes compared to risk-neutral travelers. This route selection behavior could increase the total system travel cost due to congestion on preferred routes. Such scenarios are more likely to occur when a route exhibits higher elasticity in its capacity response to demand fluctuations. Under these circumstances, providing pre-trip information proves more advantageous for risk-preferred and risk-averse travelers. Conversely, when two routes maintain comparable and stable capacities, the situation described in Proposition 10 becomes more prevalent. In this case, providing pre-trip information yields greater benefits if all travelers are risk-neutral.

5. Numerical Analysis

In this section, we present the results of the numerical analysis to illustrate further the effects of pre-trip information on system efficiency under varying risk-preference coefficients.

5.1. The Effect of Pre-Trip Information in the General Condition

Firstly, we consider UE states Q 1 Z = 0 and Q 1 Z = Q in the general condition. Figure 10 shows examples of welfare gains by shifting from zero information to full information in the two UE states. One can see that providing pre-trip information is always welfare-improving ( G Z F 0 ). Moreover, we can see that providing pre-trip information can gain more benefits when a 2 a 1 increases/decreases for Q 1 Z = 0 / Q 1 Z = Q . This is in consistent with Proposition 5. In real-world traffic scenarios, we often encounter situations where two alternative routes between an origin and destination (OD) offer similar travel times. One route is a longer-distance highway with higher speeds, while the other is a shorter urban arterial road featuring more traffic lights and lower speeds. Without traffic information, most travelers may prefer the highway for its perceived smoother flow. However, increased highway traffic could lead to significant travel time delays, which should be prevented. A judicious solution involves providing pre-trip information to divert a portion of travelers to urban arterial roads, thereby effectively minimizing total system travel costs.
Figure 11 shows benefit gains/losses from pre-trip information under different λ . For the specific parameters, case 3a and case 3c do not exist when a 2 a 1 increases from to + . In Figure 11a–d,f–i, there are two UE states (the welfare gains G 0 or G Q corresponding to UE state Q 1 Z = 0 or Q 1 Z = Q in the zero-information regime) when λ < λ 4 ( λ < λ 3 ); the welfare gains G 0 correspond to UE state Q 1 Z = 0 when λ 4 < λ < λ 3 ( λ 3 < λ < λ 4 ); and a unique UE state exists when λ > λ 3 ( λ > λ 4 ). This is in consistent with Proposition 2. Furthermore, the minimum value is observed at λ = λ 5 in cases 1b, 1c, 1d, 3d, and 3e. This is in consistent with Proposition 3.
Moreover, from Figure 11a,i, one can see that pre-trip information is always beneficial ( G Z F 0 ) in case 1a and 3f. This is in consistent with Corollary 1. Providing pre-trip information is welfare-improving when λ < λ 3 in case 1c and case 2; when λ < λ 4 in case 3b and case 3d; when λ < λ 7 in case 1d; when λ < λ 3 or λ > λ 6 in case 1b; and when λ < λ 4 or λ > λ 7 in case 3e. This is in consistent with Corollary 2. Under other circumstances, providing pre-trip information may have either positive or negative impact on improving the welfare gains, which depends on the parameters.

5.2. The Effect of Pre-Trip Information in the Special Case p = 1

The Figure 12 plots show the benefit gains from pre-trip information under different λ in the special case p = 1 . For the specific parameters, (i) case 1d and case 3b do not exist when a 2 a 1 increases from to + ; and (ii) providing pre-trip information is always welfare-improving.
From Figure 12a,h, one can see that risk-neutral travelers ( λ = 0 ) obtain no more benefit gains than risk-preferred ones ( λ < 0 ) or risk-averse ones ( λ > 0 ) in case 1a or 3f. This is in consistent with Proposition 6. Moreover, risk-neutral travelers obtain no more welfare gains than risk-preferred ones with risk attitude (i) λ < λ 3 in case 2; (ii) λ < λ 6 in case 3a and case 3c, or risk-averse ones with risk attitude (iii) λ > λ 6 in case 1b; (iv) λ > λ 7 in case 3e. This is consistent with Proposition 7–9. Nevertheless, risk-neutral travelers obtain more welfare gains than risk-averse ones with risk attitude (v) λ > λ 8 in case 3c and case 3d; (vi) λ 4 < λ < λ 7 in case 3e. This is consistent with Proposition 10.

5.3. The Effect of Pre-Trip Information on Different Routes

Figure 13 shows two examples of benefit gains/losses from pre-trip information on different routes. In example 1 (Figure 13a), given a 1 = a 2 , full information is always welfare-improving on the network ( G Z F 0 ) (see Figure 13a). While providing pre-trip information is welfare-improving on both routes when 0.3 < λ < 0.15 , information is welfare-improving on route 2 (route 1) and welfare-reducing on route 1 (route 2) when λ < 0.3 ( λ > 0.15 ). In example 2, the free-flow travel costs are significantly larger on route 2 ( a 2 = 5 ) than those on route 1 ( a 1 = 0 ). Unfortunately, a counterintuitive information paradox occurs when travelers are risk-averse with the risk-preference coefficient λ > 2.14 (see Figure 13b). In this example, providing information exerts adverse effects. This result suggests that we should not blindly provide pre-trip information to travelers. Instead, it is crucial to comprehensively consider factors such as free-flow travel costs, the reliability of different routes, and travelers’ risk attitudes when deciding whether to disseminate information.

6. Conclusions and Discussion

In this study, we extended the classical two-route network model proposed by Lindsey et al. [28] and considered travelers’ risk attitudes. The travel time variability due to stochastic network link capacity variations has been taken into account. We postulated that travelers acquire the variability in route travel time based on past experiences and factor such variability into their route choice consideration in the form of a “travel time budget”. Two information regimes, zero-information and full-information regimes, were considered. Commuters only know the unconditional probability distribution of conditions on the two routes in the zero-information regime, while they are provided the road conditions before choosing a route in the full-information regime.
User equilibrium states of the two regimes have been analyzed. In the special case p = 1 , the closed form solutions have been derived. Three cases and eleven subcases have been classified concerning the dependence of expected total travel times on the risk attitude in the zero-information regime. In the general condition p > 0 , although we are not able to derive the closed form solutions, we proved that the results are qualitatively unchanged.
We have studied the benefit gains/losses by shifting from the zero-information to the full-information regime. The circumstance under which pre-trip information is beneficial has been identified. We also demonstrated that risk-averse (risk-preferred) travelers might obtain more/less welfare than risk-neutral ones. Thus, the assumption that travelers are risk-neutral may underestimate or overestimate the benefit gains/losses of the information. Finally, a numerical analysis was conducted to further illustrate the benefits of information under the general conditions, which also demonstrated that while the network welfare improves/reduces, welfare on one of the routes may reduce/improve. Counterintuitively, the information paradox is more likely to occur when risk-averse travelers confront routes with substantial disparities in free-flow travel costs. Therefore, it is crucial to comprehensively consider factors such as free-flow travel costs, the reliability of different routes, and travelers’ risk attitudes when formulating traffic information dissemination strategies.
Our study has several limitations that could provide opportunities for future research. With pre-trip information, travelers might adjust their decisions from multiple aspects, e.g., travel route, departure time, travel mode, and destination. Our model only considers route choices based on the classical “two-route network”. Thus, the first extension would be to incorporate simultaneous multi-dimensional decision-making. Analyzing how travelers prioritize goals in multi-OD complex networks could deepen our understanding of pre-trip information’s impact on transportation efficiency. Second, our model features two polar information regimes. Full information is an idealization that is practically unattainable. Information on travel conditions may be imperfect and collected with delays, which should be considered in further work. Third, we assume a constant demand in commuting corridors. Yet, in emerging residential areas, dynamic demand fluctuations may significantly influence travel behavior, necessitating further exploration. Fourth, the model simplifies route states to binary conditions (good/bad). Extending this to multi-state stochastic scenarios would clarify how risk attitudes and information interact under realistic variability. Finally, we treat travelers as homogeneous. Future work should examine heterogeneous populations with diverse risk preferences to better reflect real-world decision dynamics.

Author Contributions

Methodology, Y.Y.; software, Y.Y.; investigation, H.L. and J.C.; data curation, Y.L.; writing-original draft preparation, Y.Y.; writing-review and editing, S.Z.; funding acquisition, S.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China under grant no. 72288101, the Beijing-Tianjin-Hebei Basic Research Cooperation Project under grant no. G2024210009, the National Natural Science Foundation of Ningbo under grant no. 2024J191, and the Fundamental Research Funds for the Central Universities under grant no. 2024XKRC031.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Appendix A.1. Proof of Proposition 2

Firstly, we derive the monotonicity of Q 1 Z with respect to λ as follows.
Let f λ λ , Q 1 Z and f Q 1 Z λ , Q 1 Z denote the partial derivative of f λ , Q 1 Z with respect to λ and Q 1 Z , respectively. Consider any two solutions of the equation f λ , Q 1 Z = 0 , denoted as ( λ , Q 1 Z ) and λ , Q 1 Z . Via Taylor expansion, one has
f λ , Q 1 Z = f λ , Q 1 Z + λ λ f λ λ , Q 1 Z + Q 1 Z Q 1 Z f Q 1 Z λ , Q 1 Z + O 2 .
in which O 2 is a second-order infinitesimal. Let d λ = λ λ and d Q 1 Z = Q 1 Z Q 1 Z , we can derive
d Q 1 Z d λ = f λ λ , Q 1 Z f Q 1 Z λ , Q 1 Z .
Next, we calculate f Q 1 Z λ , Q 1 Z and f λ λ , Q 1 Z , which can be formulated as
f Q 1 Z λ , Q 1 Z = p ε 1 + λ π 1 π b 1 B b 1 G Q 1 Z p 1 + p ε 2 + λ π 1 π b 2 B b 2 G Q Q 1 Z p 1 ,
and
f λ λ , Q 1 Z = π 1 π b 1 B b 1 G Q 1 Z p b 2 B b 2 G Q Q 1 Z p .
Thus,
f λ Q 1 Z λ , Q 1 Z = p π 1 π b 1 B b 1 G Q 1 Z p 1 + b 2 B b 2 G Q Q 1 Z p 1 .
It is obvious that f λ Q 1 Z λ , Q 1 Z > 0, provided 0 Q 1 Z Q . Therefore,
(a)
The function f Q 1 Z λ , Q 1 Z is an increasing one of λ . Substituting λ ± into the equation f λ , Q 1 Z = 0 , one has
Q 1 Z = [ Q 1 Z ] # # = Q / 1 + b 1 B b 1 G / b 2 B b 2 G p .
Note that 0 < [ Q 1 Z ] # # < Q . Substituting λ and λ + into f Q 1 Z λ , Q 1 Z , one has f Q 1 Z , [ Q 1 Z ] # # < 0 and f Q 1 Z + , [ Q 1 Z ] # # > 0 , respectively. Therefore, there is unique value λ = λ 0 that makes f Q 1 Z λ , Q 1 Z = 0 . As a result, f λ , Q 1 Z is a decreasing function of Q 1 Z when λ < λ 0 and an increasing function when λ > λ 0 .
(b)
The function f λ λ , Q 1 Z is an increasing one of Q 1 Z . By solving f λ λ , Q 1 Z = 0 , one has Q 1 Z = [ Q 1 Z ] # # . Substituting Q 1 Z = 0 and Q 1 Z = Q into f λ λ , Q 1 Z , one has f λ λ , 0 < 0 and f λ λ , Q > 0 , respectively. Therefore, f λ , Q 1 Z is a decreasing function of λ when 0 Q 1 Z < [ Q 1 Z ] # # and an increasing function when [ Q 1 Z ] # # < Q 1 Z Q .
Note that the function Q 1 Z with respect to λ is discontinuous at λ = λ 0 . At the discontinuity, one has f Q 1 Z λ , Q 1 Z = 0 , so that d Q 1 Z / d λ . As a result, the monotonicity of the two branches separated by λ = λ 0 is the same, provided 0 Q 1 Z Q . Moreover, because f Q 1 Z λ , Q 1 Z = k 1 k 2 , one has k 1 < k 2 when λ < λ 0 and k 1 > k 2 when λ > λ 0 . As a result, three possible cases need to be classified.
(1)
a 2 a 1 < ϕ . In this case, one has λ 4 < λ 0 < λ 3 . When λ λ 4 , one has [ Q 1 Z ] # # < Q 1 Z Q , in which f Q 1 Z λ , Q 1 Z < 0 and f λ λ , Q 1 Z > 0 , so that d Q 1 Z / d λ > 0 . When λ λ 3 , one has 0 Q 1 Z < [ Q 1 Z ] # # , in which f Q 1 Z λ , Q 1 Z > 0 and f λ λ , Q 1 Z < 0 , so that d Q 1 Z / d λ > 0 . Therefore, the function Q 1 Z is an increasing one of λ for the two branches. Moreover, when λ 4 < λ < λ 0 (or λ 0 < λ < λ 3 ), one has Q 1 Z > Q (or Q 1 Z < 0 ), because the function is continuous, except at λ = λ 0 . As a result, three possible subcases need to be classified.
-
When λ λ 4 , one can easily prove that a 2 a 1 + k 1 Q p is always met; thereby, Q 1 Z = Q is a UE state. However, according to Property 1(b), the solution [ Q 1 Z ] # # < Q 1 Z < Q is not a UE state, because k 1 < k 2 is always met when λ λ 4 ;
-
When λ λ 3 , one can easily prove that a 1 a 2 + k 2 Q p is always met. Thereby, Q 1 Z = 0 is a UE state;
-
When λ > λ 3 , it is obvious that Q 1 Z = Q or Q 1 Z = 0 is not a UE state; however, according to Property 1(c), the solution 0 < Q 1 Z < [ Q 1 Z ] # # is a UE state, because k 1 > k 2 is always met when λ > λ 3 .
This completes the proof of Proposition 2(a).
(2)
a 2 a 1 = ϕ . In this case, one has λ 3 = λ 0 = λ 4 . It is straightforward to prove that f λ λ , Q 1 = 0 is always met, so that d Q 1 Z / d λ = 0 for an arbitrary λ , in which Q 1 Z is a constant ( Q 1 Z = [ Q 1 Z ] # # ), no matter what the risk attitude is. As a result, three possible subcases need to be classified.
-
λ < λ 0 . According to Property 1(b), the solution Q 1 Z = [ Q 1 Z ] # # is not a UE state because k 1 < k 2 ; similar to the analysis above, there are two possible UE states, Q 1 Z = Q or Q 1 Z = 0 ;
-
λ > λ 0 . According to Property 1(c), the solution Q 1 Z = [ Q 1 Z ] # # is a UE state, because k 1 > k 2 ;
-
λ = λ 0 . In this subcase, k 1 = k 2 is always met when λ = λ 0 . Substituting λ = λ 0 into k 2 , one has ϕ = k 2 Q p . Thus, we have f λ , 0 = 0 , because a 2 a 1 = k 2 Q p . As a result, the functions B 1 Z Q 1 Z and B 2 Z Q 1 Z are identical. According to Property 1(a), Q 1 Z is not uniquely determined, which can be any value between 0 and Q ( 0 Q 1 Z Q ).
This completes the proof of Proposition 2(b).
(3)
a 2 a 1 > ϕ . In this case, one has λ 3 < λ 0 < λ 4 . When λ λ 3 , one has 0 Q 1 Z < [ Q 1 Z ] # # , in which f Q 1 Z λ , Q 1 Z < 0 and f λ λ , Q 1 Z < 0 , so that d Q 1 Z / d λ < 0 . When λ λ 4 , one has [ Q 1 Z ] # # < Q 1 Z Q , in which f Q 1 Z λ , Q 1 Z > 0 and f λ λ , Q 1 Z > 0 , so that d Q 1 Z / d λ < 0 . Therefore, the function Q 1 Z is a decreasing one of λ for the two branches. Moreover, when λ 3 < λ < λ 0 (or λ 0 < λ < λ 4 ), one has Q 1 Z < 0 (or Q 1 Z > Q ), because the function is continuous except at λ = λ 0 . Similar to the analysis above, three possible subcases need to be classified:
-
when λ λ 3 , one can easily prove that a 1 a 2 + k 2 Q p is always met. Thus, Q 1 Z = 0 is a UE state; however, according to Property 1(b), the solution 0 < Q 1 Z < [ Q 1 Z ] # # is not a UE state, because k 1 < k 2 is always met when λ λ 3 ;
-
when λ λ 4 , one can easily prove that a 2 a 1 + k 1 Q p is always met. Thus, Q 1 Z = Q is a UE state;
-
when λ > λ 4 , it is obvious that Q 1 Z = Q or Q 1 Z = 0 is not a UE state; however, according to Property 1(c), the solution [ Q 1 Z ] # # < Q 1 Z < Q is a UE state because k 1 > k 2 is always met when λ > λ 4 .
This completes the proof of Proposition 2(c). □

Appendix A.2. Proof of Proposition 3

Based on Proposition 2, there is no extreme point when λ < m a x λ 3 , λ 4 , because Q 1 Z = 0 or Q 1 Z = Q is the possible UE state under this case. The UE traffic demand Q 1 Z versus λ is a decreasing (an increasing) function when λ > m a x λ 3 , λ 4 . If the function E T T Z versus Q 1 Z is also a decreasing (an increasing) function, then the function E T T Z with respect to λ has no extreme point.
Next, we study the monotonicity of the function E T T Z with respect to Q 1 Z . The first and second-order derivative of E T T Z with respect to Q 1 Z are
d E T T Z d Q 1 Z = a 1 a 2 + p + 1 ε 1 Q 1 Z p p + 1 ε 2 Q Q 1 Z p ,   and
d 2 E T T Z d Q 1 Z 2 = p p + 1 ε 1 Q 1 Z p 1 + p p + 1 ε 2 Q Q 1 Z p 1 .
Since 0 Q 1 Z Q is always met, one has d 2 E T T Z / d Q 1 Z 2 > 0 , so that d E T T Z / d Q 1 Z is an increasing function of Q 1 Z : the minimum of d E T T Z / d Q 1 Z is a 1 a 2 p + 1 ε 2 Q p and the maximum is a 1 a 2 + p + 1 ε 1 Q p . The function E T T Z is an increasing (or a decreasing) function of Q 1 Z when a 2 a 1 < p + 1 ε 2 Q p (or a 2 a 1 > p + 1 ε 1 Q p ). There is no extreme point for function E T T Z versus λ under this case. However, a unique extreme point exists when p + 1 ε 2 Q p < a 2 a 1 < p + 1 ε 1 Q p , in which E T T Z firstly decreases and then increases with Q 1 Z . □

Appendix A.3. Proof of Proposition 4

It is obvious that the solution Q 1 s s F = Q ^ 1 s s F < 0 or Q 1 s s F = Q ^ 1 s s F > Q is not a UE state, because 0 Q 1 s s F Q should be met. As a result, three cases need to be classified:
(1)
when a 2 a 1 b 2 s Q p , it is clear that Q 1 s s F = 0 is a UE state and Q 1 s s F = Q is not a UE state. Substituting a 2 a 1 b 2 s Q p and 0 < Q ^ 1 s s F < Q into Equation (34), one has
g Q ^ 1 s s F b 1 s Q ^ 1 s s F p + b 2 s Q p Q Q ^ 1 s s F p > 0 .
This goes against the UE principle g Q 1 s s F = 0 . Therefore, Q 1 s s F = 0 is a unique UE state.
(2)
when a 2 a 1 b 1 s Q p , it is clear that Q 1 s s F = Q is a UE state and Q 1 s s F = 0 is not a UE state. Substituting a 2 a 1 b 1 s Q p and 0 < Q ^ 1 s s F < Q into Equation (34), one has
g Q ^ 1 s s F b 2 s Q Q ^ 1 s s F p < 0 .
This goes against the UE principle g Q 1 s s F = 0 . Therefore, Q 1 s s F = Q is a unique UE state.
(3)
when b 2 s Q p < a 2 a 1 < b 1 s Q p , it is clear that neither Q 1 s s F = 0 nor Q 1 s s F = Q is a UE state. Assume that the slopes of functions T 1 s Q 1 s s F and T 2 s Q 1 s s F under the solution Q 1 s s F = Q ^ 1 s s F are
k 1 = p b 1 s Q ^ 1 s s F p 1 ,   and
k 2 = p b 2 s Q Q ^ 1 s s F p 1 .
Substituting b 2 s Q p < a 2 a 1 < b 1 s Q p and 0 < Q ^ 1 s s F < Q into the above equations, one has k 1 > 0 and k 2 < 0 . According to Property 1(c), 0 < Q 1 s s F = Q ^ 1 s s F < Q is a UE state. Next, we prove that the solution is unique. The derivative of g Q ^ 1 s s F with respect to Q ^ 1 s s F is
d g Q ^ 1 s s F / d Q ^ 1 s s F = p b 1 s Q ^ 1 s s F p 1 + p b 2 s Q Q ^ 1 s s F p 1 > 0 ;
Thus, g Q ^ 1 s s F is an increasing function of Q ^ 1 s s F . Therefore, there is a unique 0 < Q ^ 1 s s F < Q that meets g Q ^ 1 s s F = 0 , and Q 1 s s F = Q ^ 1 s s F is a unique UE state. □

Appendix A.4. Proof of Proposition 5

Assuming Q 1 Z = 0 , from Equation (5), one has
E [ T T Z ] = a 2 Q + [ π b 2 B + 1 π b 2 G ] Q p + 1 .
(a)
If a 2 a 1 b 1 B Q p , together with b 1 B > b 1 G (Assumption 1), one can easily derive that all travelers choose route 1 under UE, i.e., Q 1 s s F = Q ,   s , s S . Substituting Q 1 s s F = Q into Equation (32), one has
E [ T T F ] = a 1 Q + [ π b 1 B + 1 π b 1 G ] Q p + 1 .
Since a 2 a 1 b 1 B Q p > π b 1 B b 2 B + 1 π b 1 G b 2 G Q p , one has
G Z F = E T T Z E T T F = a 2 a 1 π b 1 B b 2 B + 1 π b 1 G b 2 G Q p Q > 0 .
(b)
If b 1 G Q p a 2 a 1 < b 1 B Q p , then one has Q 1 G G F = Q 1 G B F = Q and 0 < Q 1 B G F , Q 1 B B F < Q . Substituting Q 1 G G F = Q 1 G B F = Q into Equation (32), one has
E T T F = 1 π a 1 + b 1 G Q p Q + π 2 a 2 + b 2 B Q 2 B B F p Q 2 B B F + π 1 π a 2 + b 2 G Q 2 B G F p Q 2 B G F .
Then, one has
G Z F = 1 π a 2 a 1 b 1 G Q p Q + π a 2 Q 1 π Q 2 B G F π Q 2 B B F + 1 π b 2 G Q p + 1 π Q 2 B G F p + 1 + π b 2 B Q p + 1 π Q 2 B B F p + 1 > 1 π a 2 a 1 b 1 G Q p Q > 0 .
(c)
If a 2 a 1 < b 1 G Q p , then one has 0 < Q 2 s s F Q . Substituting 0 < Q 2 s s F Q into Equation (32), one has
E T T F = 1 π 2 a 2 + b 2 G Q 2 G G F p Q 2 G G F + π 1 π a 2 + b 2 G Q 2 B G F p Q 2 B G F + π 1 π a 2 + b 2 B Q 2 G B F p Q 2 G B F + π 2 a 2 + b 2 B Q 2 B B F p Q 2 B B F a 2 Q + π b 2 B + 1 π b 2 G Q p + 1 .
Therefore, one has G Z F 0 .
When Q 1 Z = Q , the proposition can be proved in a similar way and is omitted here. □

References

  1. Levinson, D. The value of advanced traveler information systems for route choice. Transp. Res. Part C Emerg. Technol. 2003, 11, 75–87. [Google Scholar] [CrossRef]
  2. Luo, X.; Liu, Y.; Yu, Y. Dynamic bus dispatching using multiple types of real-time information. Transp. B Transp. Dyn. 2019, 7, 519–545. [Google Scholar] [CrossRef]
  3. Mori, U.; Mendiburu, A.; Alvarez, M.; Lozano, J.A. A review of travel time estimation and forecasting for advanced traveler information systems. Transp. A Transp. Sci. 2015, 11, 119–157. [Google Scholar]
  4. Neil, L.; Richard, H.; Jeff, H. Driver opinion of message requirements for advanced traveler information systems. Plant Physiol. 1970, 45, 576–578. [Google Scholar]
  5. Perez, W.A.; Mast, T.M. Human factors and advanced traveler information systems (ATIS). Proc. Hum. Factors Ergon. Soc. Annu. Meet. 1992, 36, 1073–1077. [Google Scholar] [CrossRef]
  6. Rapoport, A.; Gisches, E.J.; Daniel, T.; Lindsey, R. Pre-trip information and route-choice decisions with stochastic travel conditions: Experiment. Transp. Res. Part B Methodol. 2014, 68, 154–172. [Google Scholar] [CrossRef]
  7. Sen, S.; Pillai, R.; Joshi, S.; Rathi, A.K. A mean-variance model for route guidance in advanced traveler information systems. Transp. Sci. 2001, 35, 37–49. [Google Scholar] [CrossRef]
  8. Emmerink, R.H.M.; Nijkamp, P.; Rietveld, P.; Van Ommeren, J.N. Variable message signs and radio traffic information: An integrated empirical analysis of drivers’ route choice behavior. Transp. Res. Part A Policy Pract. 1996, 30, 135–153. [Google Scholar] [CrossRef]
  9. Li, M.; Lin, X.; He, F.; Jiang, H. Optimal locations and travel time display for variable message signs. Transp. Res. Part C Emerg. Technol. 2016, 69, 418–435. [Google Scholar] [CrossRef]
  10. Wang, C.; David, B.; Chalon, R. Dynamic road lane management study. Transp. Res. Part E Logist. Transp. Rev. 2016, 89, 272–287. [Google Scholar] [CrossRef]
  11. Yu, Y.; Machemehl, R.B.; Xie, C. Demand-responsive transit circulator service network design. Transp. Res. Part E Logist. Transp. Rev. 2015, 76, 160–175. [Google Scholar] [CrossRef]
  12. Ahmed, A.; Ngoduy, D.; Watling, D. Prediction of traveller information and route choice based on real-time estimated traffic state. Transp. B Transp. Dyn. 2016, 4, 23–47. [Google Scholar] [CrossRef]
  13. Ben-Elia, E.; Avineri, E. Response to travel information: A behavioral review. Transp. Rev. 2015, 35, 352–377. [Google Scholar] [CrossRef]
  14. Chorus, C.G.; Eric JE, M.; van Wee, B. Travel information as an instrument to change car drivers’ travel choices: A literature review. Eur. J. Transp. Infrastruct. Res. 2006, 6, 335–364. [Google Scholar]
  15. Chorus, C.G.; Arentze, T.A.; Timmermans, H.J.P. Traveler compliance with advice: A Bayesian utilitarian perspective. Transp. Res. Part E Logist. Transp. Rev. 2009, 45, 486–500. [Google Scholar] [CrossRef]
  16. Golob, T.F.; Regan, A.C. The perceived usefulness of different sources of traffic information to trucking operations. Transp. Res. Part E Logist. Transp. Rev. 2002, 38, 97–116. [Google Scholar] [CrossRef]
  17. Los, J.; Schulte, F.; Spaan, M.T.J. The Value of Information Sharing for Platform-Based Collaborative Vehicle Routing. Transp. Res. Part E Logist. Transp. Rev. 2020, 141, 102011. [Google Scholar] [CrossRef]
  18. Wepulanon, P.; Sumalee, A.; Lam, W.H.K. A real-time bus arrival time information system using crowdsourced smartphone data: A novel framework and simulation experiments. Transp. B 2017, 6, 34–53. [Google Scholar] [CrossRef]
  19. Zhu, Z.; Li, X.W.; Liu, W.; Yang, H. Day-to-day evolution of departure time choice in stochastic capacity bottleneck models with bounded rationality and various information perceptions. Transp. Res. Part E Logist. Transp. Rev. 2019, 131, 168–192. [Google Scholar] [CrossRef]
  20. Ben-Elia, E.; Pace, R.D.; Bifuico, G.N. The impact of travel information’s accuracy on route-choice. Transp. Res. Part C Emerg. Technol. 2013, 26, 146–159. [Google Scholar] [CrossRef]
  21. Engelson, L.; Fosgerau, M. Scheduling preferences and the value of travel time information. Transp. Res. Part B Methodol. 2020, 134, 256–265. [Google Scholar] [CrossRef]
  22. Khattak, A.J.; Yim, Y.; Prokopy, L.S. Willingness to pay for travel information. Transp. Res. Part C Emerg. Technol. 2003, 11, 137–159. [Google Scholar] [CrossRef]
  23. Mahmassani, H.S.; Chee, C.T. Availability of information and dynamics of departure time choices: Experimental investigation. Transp. Res. Rec. J. Transp. Res. Board 1986, 1085, 33–49. [Google Scholar]
  24. Emmerink, R.H.M.; Kay, W.A.; Peter, N.; Piet, R. The potential of information provision in a simulated road transport network with non-recurrent congestion. Transp. Res. Part C Emerg. Technol. 1995, 3, 293–309. [Google Scholar] [CrossRef]
  25. Acemoglu, D.; Makhdoumi, A.; Malekian, A.; Ozdaglar, A. Informational braess’ paradox: The effect of information on traffic congestion. Oper. Res. 2016, 66, 893–917. [Google Scholar] [CrossRef]
  26. Emmerink, R.H.M.; Verhoef, E.T.; Nijkamp, P.; Rietveld, P. Information policy in road transport with elastic demand: Some welfare economic considerations. Eur. Econ. Rev. 1998, 42, 71–95. [Google Scholar] [CrossRef]
  27. Verhoef, E.T.; Emmerink, R.H.M.; Nijkamp, P.; Rietveld, P. Information provision, flat and fine congestion tolling and the efficiency of road usage. Reg. Sci. Urban Econ. 1996, 26, 505–529. [Google Scholar] [CrossRef]
  28. Lindsey, R.; Daniel, T.; Gisches, E.J.; Rapoport, A. Pre-trip information and route-choice decisions with stochastic travel conditions: Theory. Transp. Res. Part B Methodol. 2014, 67, 187–207. [Google Scholar] [CrossRef]
  29. Abdel-Aty, M.A.; Kitamura, R.; Jovanis, P.P. Investigating effect of travel time variability on route choice using repeated-measurement stated preference data. Transp. Res. Rec. 1995, 1493, 39–45. [Google Scholar]
  30. Jackson, W.B.; Jucker, J.V. An empirical study of travel time variability and travel choice behavior. Transp. Sci. 1982, 16, 460–475. [Google Scholar] [CrossRef]
  31. Chen, A.; Zhou, Z. The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Transp. Res. Part B Methodol. 2010, 44, 493–513. [Google Scholar] [CrossRef]
  32. Chen, A.; Zhou, Z.; Lam, W.H.K. Modeling stochastic perception error in the mean-excess traffic equilibrium model. Transp. Res. Part B Methodol. 2011, 45, 1619–1640. [Google Scholar] [CrossRef]
  33. Xu, X.; Chen, A.; Cheng, L. Assessing the effects of stochastic perception error under travel time variability. Transportation 2013, 40, 525–548. [Google Scholar] [CrossRef]
  34. Xu, X.; Chen, A.; Cheng, L.; Lo, H.K. Modeling distribution tail in network performance assessment: A mean-excess total travel time risk measure and analytical estimation method. Transp. Res. Part B Methodol. 2014, 66, 32–49. [Google Scholar] [CrossRef]
  35. Zhou, Z.; Chen, A. Comparative analysis of three user equilibrium models under stochastic demand. J. Adv. Transp. 2008, 42, 239–263. [Google Scholar] [CrossRef]
  36. Lo, H.K.; Tung, Y.K. Network with degradable links: Capacity analysis and design. Transp. Res. Part B Methodol. 2003, 37, 345–363. [Google Scholar] [CrossRef]
  37. Lo, H.K.; Luo, X.W.; Siu, B.W.Y. Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion. Transp. Res. Part B Methodol. 2006, 40, 792–806. [Google Scholar] [CrossRef]
  38. Yin, Y.; Lam, W.H.K.; Ieda, H. New technology and the modeling of risk-taking behavior in congested road networks. Transp. Res. Part C 2004, 12, 171–192. [Google Scholar] [CrossRef]
  39. Tan, Z.; Yang, H.; Guo, R. Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers. Transp. Res. Part B Methodol. 2014, 66, 16–31. [Google Scholar] [CrossRef]
  40. Li, Z. Unobserved and observed heterogeneity in risk attitudes: Implications for valuing travel time savings and travel time variability. Transp. Res. Part E Logist. Transp. Rev. 2018, 112, 12–18. [Google Scholar] [CrossRef]
  41. U.S. Bureau of Public Roads. Traffic Assignment Manual; U.S. Bureau of Public Roads: Washington, DC, USA, 1964.
Figure 1. The classical “two-route network”. The probability of a bad condition ( B ) occurring is π , and the probability of a good condition ( G ) occurring is 1 π on each route.
Figure 1. The classical “two-route network”. The probability of a bad condition ( B ) occurring is π , and the probability of a good condition ( G ) occurring is 1 π on each route.
Systems 13 00407 g001
Figure 2. Equilibrium state in scenario A. (a) a 1 = a 2 + k 2 Q , (b) a 1 > a 2 + k 2 Q , (c) a 1 < a 2 + k 2 Q .
Figure 2. Equilibrium state in scenario A. (a) a 1 = a 2 + k 2 Q , (b) a 1 > a 2 + k 2 Q , (c) a 1 < a 2 + k 2 Q .
Systems 13 00407 g002
Figure 3. Equilibrium state in scenario B. (ac) k 1 < k 2 , (df) k 1 > k 2 .
Figure 3. Equilibrium state in scenario B. (ac) k 1 < k 2 , (df) k 1 > k 2 .
Systems 13 00407 g003
Figure 4. Equilibrium state in scenario C. (ac) k 1 < 0 ,   k 2 < 0   λ < λ 1 , (df) k 1 > 0 ,   k 2 > 0   λ > λ 2 .
Figure 4. Equilibrium state in scenario C. (ac) k 1 < 0 ,   k 2 < 0   λ < λ 1 , (df) k 1 > 0 ,   k 2 > 0   λ > λ 2 .
Systems 13 00407 g004
Figure 5. Relation between Q 1 Z and λ in the seven possible situations in the zero-information regime. (ag) Situations (i)–(vii).
Figure 5. Relation between Q 1 Z and λ in the seven possible situations in the zero-information regime. (ag) Situations (i)–(vii).
Systems 13 00407 g005aSystems 13 00407 g005b
Figure 6. Expected total travel time in (ad) cases 1a–1d.
Figure 6. Expected total travel time in (ad) cases 1a–1d.
Systems 13 00407 g006
Figure 7. Expected total travel time in case 2.
Figure 7. Expected total travel time in case 2.
Systems 13 00407 g007
Figure 8. Expected total travel time in (af) cases 3a–3f.
Figure 8. Expected total travel time in (af) cases 3a–3f.
Systems 13 00407 g008
Figure 9. The classical “two-route network”. The probabilities of the four states combinations G G , B G , G B , and B B occurring on the two routes are 1 π 2 , 1 π π , π 1 π , and π 2 , respectively.
Figure 9. The classical “two-route network”. The probabilities of the four states combinations G G , B G , G B , and B B occurring on the two routes are 1 π 2 , 1 π π , π 1 π , and π 2 , respectively.
Systems 13 00407 g009
Figure 10. Benefit gains from full information. (a) Q 1 Z = 0 , (b) Q 1 Z = Q . The black line separates G Z F > 0 from G Z F = 0 . The parameters are set as p = 4 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 2 , and b 2 B = 10 .
Figure 10. Benefit gains from full information. (a) Q 1 Z = 0 , (b) Q 1 Z = Q . The black line separates G Z F > 0 from G Z F = 0 . The parameters are set as p = 4 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 2 , and b 2 B = 10 .
Systems 13 00407 g010
Figure 11. Benefit gains/losses from full information under different λ . (ad) Cases 1a–1d, (e) case 2, (f) case 3b, and (gi) cases 3d–3f. The parameters are set as p = 4 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 2 , and b 2 B = 10 . In (a) a 1 = 20 , a 2 = 0 ; (b) a 1 = 10 , a 2 = 0 ; (c) a 1 = 5 , a 2 = 0 ; (d) a 1 = 2 , a 2 = 0 ; (e) a 1 = 0 , a 2 = 0.4 ; (f) a 1 = 0 , a 2 = 0.6 ; (g) a 1 = 0 , a 2 = 2.2 ; (h) a 1 = 0 , a 2 = 4.5 ; and (i) a 1 = 0 , a 2 = 8 . G 0 , G Q , and G # correspond to the welfare gains/losses under UE states Q 1 Z = 0 , Q 1 Z = Q , and Q 1 Z = Q 1 Z # # in the zero-information regime.
Figure 11. Benefit gains/losses from full information under different λ . (ad) Cases 1a–1d, (e) case 2, (f) case 3b, and (gi) cases 3d–3f. The parameters are set as p = 4 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 2 , and b 2 B = 10 . In (a) a 1 = 20 , a 2 = 0 ; (b) a 1 = 10 , a 2 = 0 ; (c) a 1 = 5 , a 2 = 0 ; (d) a 1 = 2 , a 2 = 0 ; (e) a 1 = 0 , a 2 = 0.4 ; (f) a 1 = 0 , a 2 = 0.6 ; (g) a 1 = 0 , a 2 = 2.2 ; (h) a 1 = 0 , a 2 = 4.5 ; and (i) a 1 = 0 , a 2 = 8 . G 0 , G Q , and G # correspond to the welfare gains/losses under UE states Q 1 Z = 0 , Q 1 Z = Q , and Q 1 Z = Q 1 Z # # in the zero-information regime.
Systems 13 00407 g011aSystems 13 00407 g011b
Figure 12. Benefit gains from full information under different λ . (ac) Cases 1a–1c, (d) case 2, (e) case 3a, and (fi) cases 3c–3f. The parameters are set as p = 1 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 0.5 , and b 2 B = 1.8 . In (a) a 1 = 2 , a 2 = 0 ; (b) a 1 = 1 , a 2 = 0 ; (c) a 1 = 0.6 , a 2 = 0 ; (d) a 1 = 0.1 , a 2 = 0 ; (e) a 1 = 0 , a 2 = 0.15 ; (f) a 1 = 0 , a 2 = 0.65 ; (g) a 1 = 0 , a 2 = 0.7 ; (h) a 1 = 0 , a 2 = 2 ; and (i) a 1 = 0 , a 2 = 3.5 .
Figure 12. Benefit gains from full information under different λ . (ac) Cases 1a–1c, (d) case 2, (e) case 3a, and (fi) cases 3c–3f. The parameters are set as p = 1 , Q = 1 , π = 0.25 , b 1 G = 1 , b 1 B = 3 , b 2 G = 0.5 , and b 2 B = 1.8 . In (a) a 1 = 2 , a 2 = 0 ; (b) a 1 = 1 , a 2 = 0 ; (c) a 1 = 0.6 , a 2 = 0 ; (d) a 1 = 0.1 , a 2 = 0 ; (e) a 1 = 0 , a 2 = 0.15 ; (f) a 1 = 0 , a 2 = 0.65 ; (g) a 1 = 0 , a 2 = 0.7 ; (h) a 1 = 0 , a 2 = 2 ; and (i) a 1 = 0 , a 2 = 3.5 .
Systems 13 00407 g012aSystems 13 00407 g012b
Figure 13. Benefit gains/losses from full information on different routes. (a) a 1 = a 2 and (b) a 1 a 2 . The parameters are set as p = 1 , Q = 1 , π = 0.25 , b 1 G = 3 , b 1 B = 6 ,   b 2 G = 2 , and b 2 B = 9 . In (a) a 1 = 1 and a 2 = 1 ; (b) a 1 = 0 and a 2 = 5 . The dashed green line separates G Z F 0 from G Z F < 0 .
Figure 13. Benefit gains/losses from full information on different routes. (a) a 1 = a 2 and (b) a 1 a 2 . The parameters are set as p = 1 , Q = 1 , π = 0.25 , b 1 G = 3 , b 1 B = 6 ,   b 2 G = 2 , and b 2 B = 9 . In (a) a 1 = 1 and a 2 = 1 ; (b) a 1 = 0 and a 2 = 5 . The dashed green line separates G Z F 0 from G Z F < 0 .
Systems 13 00407 g013
Table 1. Notational glossary.
Table 1. Notational glossary.
VariableDescription
F full-information regime
Z zero-information regime
i index of route
B bad condition
G good condition
s possible condition
s possible condition on route 2
S Set of conditions, S = G , B
a i free-flow travel time on route i
b i s stochastic congestion coefficient on route i when it is in state s
Q total traffic demand
Q i traffic demand on route i
Q i s s F traffic demand on route i when route 1 is in state s and route 2 is in state s in the full-information regime
T i s travel time function on route i when it is in state s
E [ ] expectations operator
T i travel time on route i
T T total travel time on the network
T T i total travel time on route i
T T s s total travel time on the network when route 1 is in state s and route 2 is in state s
E [ T i Z ] the expected travel time on route i in the zero-information regime
E [ T T Z ] the expected total travel time in the zero-information regime
E [ T T F ] the expected total travel time in the full-information regime
B i Z travel time budget on route i in the zero-information regime
v a r T i Z the variance of T i in the zero-information regime
λ risk-preference coefficient of travelers
π degradation probability of capacity ( 0 π 1 )
λ h threshold of λ , h = 0, 1, 2, …, 8 in the special case p = 1
λ h threshold of λ , h = 0, 1, 2, …, 8 in the general condition p > 0
ϕ , ϖ , φ three different thresholds of a 2 a 1
G Z F welfare gains (losses) from pre-trip information
ε i ε i = π b i B + 1 π b i G
k i k i = ε i + λ b i B b i G π 1 π
[ Q 1 Z ] # [ Q 1 Z ] # = Q 1 Z λ ±
E # E # = E [ T T z ] ( Q 1 Z = [ Q 1 Z ] # )
E 0 E 0 = E [ T T z ] ( Q 1 Z = 0 )
E Q E Q = E T T z Q 1 Z = Q
Table 2. Three possible UE patterns in scenario A.
Table 2. Three possible UE patterns in scenario A.
PatternExistence ConditionMain CharacteristicsUE StateExample
A1 a 1 = a 2 + k 2 Q B 1 Z Q 1 Z   and   B 2 Z Q 1 Z are identical 0 Q 1 Z Q Figure 2a
A2 a 1 > a 2 + k 2 Q B 1 Z Q 1 Z   is   above   B 2 Z Q 1 Z Q 1 Z = 0 Figure 2b
A3 a 1 < a 2 + k 2 Q B 1 Z Q 1 Z   is   below   B 2 Z Q 1 Z Q 1 Z = Q Figure 2c
Table 3. Six possible UE patterns in scenario B.
Table 3. Six possible UE patterns in scenario B.
PatternExistence ConditionUE StateExample
B1 k 1 < k 2
λ 1 λ < λ 0
0 < Q ¯ 1 Z < Q Q 1 Z = 0   or   Q 1 Z = Q Figure 3a
B2 Q ¯ 1 Z Q Q 1 Z = 0 Figure 3b
B3 Q ¯ 1 Z 0 Q 1 Z = Q Figure 3c
B4 k 1 > k 2
λ 0 < λ λ 2
0 < Q 1 Z < Q Q 1 Z = Q 1 Z Figure 3d
B5 Q ¯ 1 Z Q Q 1 Z = Q Figure 3e
B6 Q ¯ 1 Z 0 Q 1 Z = 0 Figure 3f
Table 4. Six possible UE patterns in scenario C.
Table 4. Six possible UE patterns in scenario C.
PatternExistence ConditionUE StateExample
C1 k 1 < 0 ,   k 2 < 0
λ < λ 1
0 < Q ¯ 1 Z < Q Q 1 Z = 0   or   Q 1 Z = Q Figure 4a
C2 Q ¯ 1 Z Q Q 1 Z = 0 Figure 4b
C3 Q ¯ 1 Z 0 Q 1 Z = Q Figure 4c
C4 k 1 > 0 , k 2 > 0
λ > λ 2
0 < Q ¯ 1 Z < Q Q 1 Z = Q ¯ 1 Z Figure 4d
C5 Q ¯ 1 Z Q Q 1 Z = Q Figure 4e
C6 Q ¯ 1 Z 0 Q 1 Z = 0 Figure 4f
Table 5. Boundary conditions for seven possible situations in the zero-information regime under p = 1 .
Table 5. Boundary conditions for seven possible situations in the zero-information regime under p = 1 .
SituationExistence ConditionExample
(i) λ 4 < λ 1 and λ 2 < λ 3   a 2 a 1 < 0 Figure 5a
(ii) λ 1 < λ 4 and λ 3 < λ 2   0 < a 2 a 1 < ϕ Figure 5b
(iii) λ 1 < λ 3 = λ 4 < λ 2   a 2 a 1 = ϕ Figure 5c
(iv) λ 1 < λ 3 and λ 4 < λ 2   ϕ < a 2 a 1 < m i n φ , ϖ Figure 5d
(v) λ 1 < λ 3 and λ 2 < λ 4   φ < a 2 a 1 < ϖ Figure 5e
(vi) λ 3 < λ 1 and λ 4 < λ 2   ϖ < a 2 a 1 < φ Figure 5f
(vii) λ 3 < λ 1 and λ 2 < λ 4   a 2 a 1 > m a x φ , ϖ Figure 5g
Table 6. Boundary conditions for 11 subcases in the zero-information regime under p = 1 .
Table 6. Boundary conditions for 11 subcases in the zero-information regime under p = 1 .
CaseSubcaseExistence ConditionExample
11a E 0 < E # < E Q   and   λ 3 > λ 5   a 2 a 1 < 2 ε 2 Q Figure 6a
1b E 0 < E # < E Q   and   λ 3 < λ 5   2 ε 2 Q < a 2 a 1 < ϕ ε 2 Q Figure 6b
1c E # < E 0 < E Q   and   λ 3 < λ 5     ϕ ε 2 Q < a 2 a 1 < m i n ϕ , ψ Figure 6c
1d E # < E Q < E 0   and   λ 3 < λ 5   ψ < a 2 a 1 < ϕ Figure 6d
2 E # < m i n E Q , E 0   and   λ 0 = λ 3 = λ 4     a 2 a 1 = ϕ Figure 7
33a E # < E 0 < E Q   and   λ 5 < λ 3     ϕ < a 2 a 1 < m i n 2 ϕ , ψ Figure 8a
3b E # < E Q < E 0   and   λ 5 < λ 3     m a x ϕ , ψ < a 2 a 1 < 2 ϕ Figure 8b
3c E # < E 0 < E Q   and   λ 5 > λ 4     2 ϕ < a 2 a 1 < ψ Figure 8c
3d E # < E Q < E 0   and   λ 5 > λ 4   m a x 2 ϕ , ψ < a 2 a 1 < ϕ + ε 1 Q Figure 8d
3e E Q < E # < E 0 and λ 5 > λ 4   ϕ + ε 1 Q < a 2 a 1 < 2 ε 1 Q Figure 8e
3f E Q < E # < E 0 and λ 5 < λ 4     a 2 a 1 > 2 ε 1 Q Figure 8f
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yu, Y.; Zheng, S.; Li, Y.; Liu, H.; Cao, J. Effect of Pre-Trip Information in a Traffic Network with Stochastic Travel Conditions: Role of Risk Attitude. Systems 2025, 13, 407. https://doi.org/10.3390/systems13060407

AMA Style

Yu Y, Zheng S, Li Y, Liu H, Cao J. Effect of Pre-Trip Information in a Traffic Network with Stochastic Travel Conditions: Role of Risk Attitude. Systems. 2025; 13(6):407. https://doi.org/10.3390/systems13060407

Chicago/Turabian Style

Yu, Yun, Shiteng Zheng, Yuankai Li, Huaqing Liu, and Jianan Cao. 2025. "Effect of Pre-Trip Information in a Traffic Network with Stochastic Travel Conditions: Role of Risk Attitude" Systems 13, no. 6: 407. https://doi.org/10.3390/systems13060407

APA Style

Yu, Y., Zheng, S., Li, Y., Liu, H., & Cao, J. (2025). Effect of Pre-Trip Information in a Traffic Network with Stochastic Travel Conditions: Role of Risk Attitude. Systems, 13(6), 407. https://doi.org/10.3390/systems13060407

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop