# A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

Authors: Kenetsu Uchida; Teppei Kato
Journal: Journal of Advanced Transportation
 (2017)

---

## Abstract

This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows). In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.


---

## Body

## 1. Introduction

Conventional frameworks for analyzing and modeling transportation systems have been confined to average representations of the network state (e.g., average link flow or average travel flow). For instance, in the traditional traffic assignment model, one can obtain a deterministic prediction of a future flow on a certain link in the network based on average origin-destination (O-D) flows, link capacities, and a form of proportional path choice model (either deterministic user equilibrium (DUE) or stochastic user equilibrium (SUE)). This represents a deterministic view of the environment and the modeler’s postulation that the variability or uncertainty in the system is not influential in system design and evaluation.There has been a growing concern over the uncertainty of travel time in transport systems and its effect on the reliability of transport services [1]. Research on network reliability has begun to address this problem [2–5]. From the traveler’s perspective, the issue of travel time reliability has been a major concern. Travelers may experience excessive variability of travel time from day to day on the same trips [6–8].In transport modeling, some advances have been made toward incorporating traffic flow uncertainties into the network modeling framework (i.e., developing a stochastic network model). Watling [9] proposed a second-order network equilibrium model that explicitly considers random path choice behavior. His model, in contrast to the conventional SUE model, uses path choice probability, as predicted by a SUE model, to define stochastic path flows that follow a multinomial distribution. The path flows derived using the traditional SUE model are, in fact, the expected flows of this multinomial distribution. In this model, the drivers choose their paths so as to minimize their perceived long-run expected travel costs. With a nonlinear travel cost function, this long-run expected travel cost will differ from the equilibrium cost computed by the conventional SUE model [10].Clark and Watling [6] extended this stochastic network model to the case with a Poisson distribution of O-D flows. Similarly, Nakayama and Takayama [11] proposed a stochastic network model with random path choice behavior but using a binomial distribution of O-D flows. These models fully represent stochastic/uncertain path choice behavior with uncertain flows. Lo et al. [12] extended their original model to consider the concept of travel time budget in path choice decision-making. Shao et al. [13] adopted a similar postulation of the central limit theorem to derive the normal distribution of the path travel time but with O-D flow distribution (normal distribution). Szeto and Solayappan [14] proposed a nonlinear complementarity problem formulation for the risk-aversive stochastic transit assignment problem. Sumalee et al. [15] address stochastic flow and stochastic capacity in a multimodal network. Uchida et al. [16] address network design problem in a stochastic multimodal network model. Uchida [17] proposed a model which simultaneously estimates the value of travel time and of travel time reliability based on the risk-averse driver’s path choice behavior. Uchida [18] proposed a network equilibrium model which estimates travel time reliability from the observed link flows in the network. Kato and Uchida [19] proposed a benefit estimation method that considers travel time reliability.In the context of the advancements in theoretical studies on travel time variability in road networks, transportation benefit-cost analysis (BCA) considering travel time variability (https://sites.google.com/site/benefitcostanalysis/benefits/travel-time-reliability;  [20]) is now becoming a big concern. The traditional DUE traffic assignment model has been widely used to estimate the value or benefits of a policy, program, or project considering no travel time variability. If we consider the value of travel time variability in estimating the benefit of a policy, the DUE traffic assignment model cannot be applied, since it does not address the stochastic nature of a travel time variability. Therefore, a plausible network equilibrium model which is well established in terms of theory and practice is needed. For BCA in which travel time variability is considered, a measure of travel time variability, which is discussed in the next section, needs to be determined. Once the travel time variability measure is determined, then a network equilibrium model which combines risk-averse driver’s path choice behavior with the generalized travel time, which is defined as a mean travel time plus a travel time variability measure multiplied by a calibration parameter, is developed. If we put more weight on the accuracy than the practicality of a network equilibrium model, then the validity of BCA may increase; however, the costs required for calculating BCA may increase, and vice versa. Therefore, the modeler has to consider the trade-off between accuracy and practicality. The objective of this study is to propose a simplified and plausible network equilibrium model which takes into account both the risk-averse driver’s path choice behavior and the travel time variability. The difference between this study and the other studies that the authors have presented is that we propose a model that can be applied to a large network problem. The stochastic network models that the authors have developed require path enumeration in the network. However, the enumeration of all possible paths is difficult in the case of a large network. Therefore, a stochastic network model for travel time reliability analysis that solves a large network problem is demanded.This paper starts by examining several measures of travel time variability in the next section. Based on the discussion provided in the next section, we will employ a travel time variance as a measure of travel time variability in this study. Then, link and path travel time under stochastic demand flows are formulated in Section3. In Section 4, two network equilibrium models under stochastic demand flows are formulated considering a risk-averse driver’s path choice behavior in a road network. The first model introduces path travel time variance which is calculated considering all travel time covariances between two links in the network. The generalized travel time in this model is not additive since the generalized path travel time is not equal to the sum of the generalized link travel times related to that path. The second model, which we propose in this study, is a simplified version of the first model. In this model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. The generalized path travel time in this model is additive. It is shown that a unique solution is provided by the simplified network model. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. Finally, concluding remarks are provided in Section 6.


## 2. Measures of Travel Time Variability

We will briefly review how to obtain a measure of travel time variability based on the expected utility maximization principle. Vickrey [21] considered a separable or additive utility function which is a sum of utilities obtained from time spent at an origin and time spent at a destination of a trip. Using such formulation of utility, it is possible to consider a driver who chooses a departure time optimally in order to maximize expected utility when facing uncertain travel time. Noland and Small [22], Bates et al. [23], Fosgerau and Karlström [24], Fosgerau and Engelson [25], and Engelson [26] have shown how measures of travel time variability can be derived from the drivers’ scheduling preferences.A popular formulation of scheduling preferences is theα-β-γ preference in which the marginal utility of time (MUT) at the origin is constant and that at the destination is a step function [27, 28]. By assuming an exponential travel time distribution or a uniform travel time distribution, Noland and Small [22] derived the scheduling utility which is linear in μ,σ, where μ and σ are the mean and standard deviation (SD) of the stochastic travel time. Fosgerau and Karlström [24] generalized this result to any travel time distributions. Fosgerau and Engelson [25] considered the value of travel time reliability under scheduling preferences that were defined in terms of linear MUTs being at the origin and at the destination. They found that the scheduling utility was linear in μ,μ2,σ2 and that this result was independent of the shape of a travel time distribution.Engelson [26] derived the scheduling utility for the two cases when the MUTs at both the origin and the destination are either quadratic or exponential in form, and demonstrated special cases when the scheduling utility is additive. The necessary condition when the scheduling utility is additive is that the MUT at the origin is a positive constant.Engelson and Fosgerau [29] derived a measure of travel time variability for travelers equipped with scheduling preferences defined in terms of MUT and who chose departure time optimality. In the case of ht=h0 and wt=h0+γ/β·eβ·t-t0-1 which are, respectively, MUT at the origin and that at the destination evaluated at clock time t (the parameters in the MUTs satisfy the following conditions: h0>0,β≥0,γ>0, and ht0=wt0), the scheduling utility is(1)ut,T=∫tt0h0dτ+E∫t0t+Th0+γβ·eβ·τ-t0-γβdτ=h0·μ-γβ·t-t0+μ+γβ2·eβ·t-t0·Eeβ·T-1,where T is an independently distributed random travel time with a mean value of μ and an SD of σ and t0 is the time such that the individual prefers being at the origin before this time and at the destination after this time. From the first-order condition, the scheduling utility is derived as(2)uT=h0·μ+γβ2·ln⁡Eeβ·T-μ,where ln⁡Eeβ·T-μ is the cumulant-generating function (CGF) of the centralized travel time distribution. A limiting case of β→0 yields(3)limβ→0uT=h0·μ+γ2·σ2.If the travel time distribution has compact support, then the scheduling utility is finite for any β and can be presented as the convergent Taylor series(4)uT=h0·μ+γ2·σ2+γ·∑n=3∞βn-2·knn!,where kn is the cumulant of order n of the travel time distribution. If the travel time follows a normal distribution, however, the normal distribution does not have compact support, and for any β the scheduling utility is(5)uT=h0·μ+γ2·σ2.A special case of this problem with constant ht≡α and the two-valued function wt=α-β for t<t0 and wt=α+β for t≥t0 leads to the α-β-γ preferences model. It was reported that (2) and (3) have advantages over the α-β-γ preferences model. First, they do not depend on the shape of the travel time distribution. The second is additivity with respect to parts of trip with independent travel time, which is an important property to analyze travel time reliability in a road network. Travel time variance as a measure of travel time variability may be criticized for not taking into account the skewness of the travel time distribution [30]. The CGF depends on the skewness (k3/σ3=ET-μ3/σ3) of the travel time distribution for nonzero β. However, the travel time covariance between two links is not taken into account in a CGF in which independent link travel time is assumed. The effect of link travel time covariance terms on the path travel time variance becomes larger than that of the skewness as the number of links in a path increases. For example, if a path is comprised of n links, the number of link travel time covariance terms taken into account in calculating the path travel time variance is nC2. We recognize that the travel time covariance between two links is a more important factor in analyzing travel time reliability in a road network than the skewness of the travel time distribution.Hjorth et al. [31] analyzed the stated preference data by applying the scheduling preferences model that assumes MUTs at the origin and at the destination. They have shown that the value of travel time variability can be proportional to the variance of travel time. This result can partially support the use of travel time variance as a measure of travel time variability.The additivity of the scheduling utility is a convenient property for a network equilibrium model from the practical viewpoint (calculation cost efficiency, ease of handling the network equilibrium model, etc.). If we employ an SD related measure of the travel time variability (SD, percentile value, etc.), unrealistic drivers’ path choice behavior as shown next may be generated.The following example is cited from Cominetti and Torrico [32]. The generalized travel time of a random travel time T is given by(6)cT=μ+ω^·σ,where we assume ω^=1 without loss of generality. We consider then the traffic situation shown in Figure 1 in which a road network consists of three nodes and three links, and the stochastic link travel time is shown. In the network, link travel time is denoted by Tii=1,…,3, where i is link number, which follows the normal distribution Nμ,σ2 with a mean of μ and a variance of σ2. From the link travel times shown in the figure, we obtain cT1=12, cT2=10+5, cT1+T3=21+3, and cT2+T3=20+7. From these four generalized travel times, the following results can be obtained. The minimum generalized travel time between nodes 1 and 2 is 12, and the minimum path consists of link 1. The minimum generalized travel time between nodes 1 and 3 is min⁡(cT1+T3cT2+T3)=20+7, and the minimum path consists of links 2 and 3. This example shows that a driver in a network with an origin node 1 and a destination node 2 will choose the path comprising link 1 if he/she prefers smaller generalized travel time. However, the same driver in the network whose origin and destination nodes are, respectively, 1 and 3 will choose the path comprising two links 2 and 3. However, the path choice criterion is clear, and the path choice behavior of the driver is somehow unrealistic. Even though the mean deviation is used instead of SD, such an unrealistic case can occur since the generalized path travel time is not equal to the sum of the generalized travel times of the links that comprise that path in the case of mean deviation.Figure 1
A paradoxical path choice.We examined the convenience and importance of the additivity of the generalized path travel time when addressing it in a network problem. In the following, we formulate some network equilibrium models in which travel time variance is employed as a measure of the travel time variability in reference to (5). According to (5), the generalized travel time is given by(7)c=uh0=μ+ω·σ2,where(8)ω=γ2·h0.


## 3. Link and Path Travel Times under Stochastic Flows

### 3.1. Notation

The notations below are used in this paper.A: Set of links in the networkI: Set of O-D pairs in the networkJi: Set of paths between O-D pair iδaj: Variable that equals 1 if link a is part of path j and equals 0 otherwiseVa: Stochastic flow of link ava: Mean flow of link avab: Mean flow that passes through both links a and bca: Capacity of link aFij: Stochastic flow of path j between O-D pair ifij: Mean flow of path j between O-D pair iQi: Stochastic flow for O-D pair iqi: Mean flow for O-D pair iQ: Stochastic total O-D flowq: Total mean O-D flowpij: Path choice probability for O-D pair i choosing path jpi: Proportion of mean flow for O-D pair i, qi, to total mean flow, qcvi: Coefficient of variation of random flow QiΞij: Stochastic travel time of path j which serves O-D pair icij: Generalized travel time of path j which serves O-D pair i.


### 3.2. Stochastic Traffic Flows

An O-D flow,Qi, is assumed to be a random variable with a mean of EQi=qi and a variance of varQi=cvi·qi2, where cvi is the coefficient of variation of the random flow Qi. Following Lam et al. [33], the stochastic flow on path j∈Ji, Fij, is then given by (9)Fij=pij·Qi∀i∈I,∀j∈Ji.Fij is a random variable with a mean of fij=pij·qi≥0 and a covariance of covFij,Fik=pij·pik·varQi, where pijj∈Ji is path choice probability which can be determined by a path choice model (DUE, SUE, etc.). The following flow conservation law holds for each O-D pair:(10)∑j∈Jifij=qi∀i∈I.The variance of Fij is given by(11)varFij=varpij·Qi=pij2·varQi=cvi·fij2∀i∈I,∀j∈Ji.The conservation of the path flow variance in relation to the O-D flow variance holds (Appendix A). The stochastic flow of link a, Va, is given by(12)Va=∑i∈I∑j∈Jiδaj·Fij∀a∈A.The mean and covariance of the stochastic link flow are then(13)va=∑i∈I∑j∈Jiδaj·fij=∑i∈I∑j∈Jiδaj·pij·qi∀a∈A,(14)covVa,Vb=var∑i∈I∑j∈Jiδaj·δbj·Fij∀a,b∈A,where ∑i∈I∑j∈Jiδaj·δbj·Fij is the sum of all stochastic path flows that pass through both links a and b.


### 3.3. Stochastic Link Travel Time and Stochastic Path Travel Time

In this study, link travel time is represented by the following BPR function [34]:(15)tava=ta0·1+κ·vacaλ∀a∈A,where ta0 is free flow travel time of link a and κ≥0 and λ≥1 are calibration parameters. By substituting va in (15) with Va, we obtain(16)taVa=ta0+κ^a·Vaλ∀a∈A,where κ^a=ta0·κ/caλ.Next, we will show how to calculate both a mean value and variance of the stochastic link travel time shown by (16). By performing an mth-order m≥1 Taylor expansion to (16) at Va=va, we obtain (17)taVa=∑k=0mbka·Va-vak∀a∈A,where bka is the coefficient of the kth term of the Taylor expansion given by(18)bka=1k!·∂ktaVa∂VakVa=va=tavaifk=0κ^a·∏l=1kλ-l+1k!·vaλ-kotherwise.The mean link travel time is then calculated as(19)EtaVa=∑k=0mbka·EVa-vak∀a∈A.The travel time covariance between two links is(20)covtaVa,tbVb=∑k=0m∑l=0mbka·blb·EVa-vak·Vb-vbl-EtaVa·EtbVb∀a,b∈A.As shown in Clark and Watling [6], (19) and (20) can be calculated by applying a method proposed by Isserlis [35] given the moments of Va by assuming that the link flow follows normal distribution [17, 18, 33]. This assumption was supported by Rakha et al. [36], which demonstrated that the normality assumption may be sufficient from a practical standpoint given its computational simplicity. Equation (19) can be calculated as follows:(21)EtaVa=b0a+∑k=1m/2∏l=1k2l-1·b2k,a·varVakm:evennumberb0a+∑k=1m-1/2∏l=1k2l-1·b2k,a·varVakm:oddnumber∀a∈A.The results of m=4 are provided in Appendix B.We now assume that the coefficient of each O-D flow takes a specific value. By applying this assumption to (14) (i.e., cvi=cv∀i∈I), we obtain(22)covVa,Vb=var∑i∈I∑j∈Jiδaj·δbj·Fij=cv·vab2∀a,b∈A,where(23)vab=∑i∈I∑j∈Jiδaj·δbj·fij∀a,b∈A.vab in (23) is the mean flow that passes through both links a and b. If a=b in (22), then we obtain varVa=cv·va2∀a∈A.In fact, this assumption can be justified if we regard total O-D flow in the network,Q=∑i∈IQi, as a random variable with a mean of EQ=q=∑i∈Iqi and a variance of varQ=cv·q2, where Qi=pi·Q. pi=qi/q is the proportion of the O-D flow, qi, to total O-D flow, q. In this case, all O-D flows are statistically dependent on each other. The conservation of the O-D flow variance in relation to the total O-D flow variance holds (Appendix C).By substituting (22) into (19) and (20), we obtain(24)EtaVa=tava+∑k=1∏l=1k2l-1·b^2k,a·vaλ∀a∈A,(25)covtaVa,tbVb=∑k=1mckm·vaλ-k·vbλ-k·vab2k∀a,b∈A,where(26)b^k,a=κ^a·cvk·∏l=1kλ-l+1k!.ckm in (25) is the coefficient for the kth term. The results of m=4 are provided in Appendix D.Note that it is shown from (24) and (25) that the mean, variance, or covariance of link travel time is expressed by using only mean link flow(s) with some given parameters, and it will be shown that both EtaVa and covtaVa,tbVb are increasing functions with respect to va and vab, respectively. It will be shown that these two mathematical properties are convenient for developing a network equilibrium model. The most dominant reason for these two properties is that the coefficients of variation of all O-D flows are assumed to be the same. Thanks to this assumption, any moments for the stochastic link flow can be calculated by using its mean value. Also, as far as the Taylor series expansion provides good approximation, the method presented in this study can be applied to any functional forms. Since the Taylor series expansion can approximate well the function of fx=1/1-x for 0<x≤1, the proposed method can be applied to the Davidson type link cost function. From (25), covtaVa,tbVb>0 if and only if vab>0. From (23), if vab>0, then va>0 and vb>0; however, the inverse relationship does not always hold for any two links in the network (i.e., even though va>0 and vb>0, vab can be zero). These two mathematical properties show that the travel time covariance of two links, covtaVa,tbVb, is greater than zero if and only if vab is greater than zero and that va and va can influence the travel time covariance of two links, covtaVa,tbVb, if and only if vab is greater than zero. Therefore, a calculation of vab is important to calculate covtaVa,tbVb in the network. As discussed in the next section, the calculation of vab for two adjacent links in the network is easily implemented since there is no need to enumerate a path set in the network. In contrast, the calculation of vab for two unconnected links in the network becomes more difficult than that for two adjacent links since that may need to enumerate a path set in the network.For notational simplicity, in the rest of the paper,EtaVa, vartaVa, and covtaVa,tbVb are denoted by t^ava, σa2va, and σabvab;va,vb, respectively. The travel time of path j which serves O-D pair i (Ξij) is given by (27)Ξij=∑a∈AtaVa·δaj∀i∈I,∀j∈Ji.The mean path travel time and path travel time variance are, respectively, given by(28)EΞij=E∑a∈AtaVa·δaj=∑a∈At^ava·δaj∀i∈I,∀j∈Ji,varΞij=var∑a∈AtaVa·δaj=∑a∈A∑b∈Aδaj·δbj·σabvab,va,vb=∑a∈Aσa2va·δaj+2∑a∈A∑b≠a∈Aδaj·δbj·σabvab,va,vb∀i∈I,∀j∈Ji.The path travel time covariance is(29)covΞij,Ξik=cov∑a∈Aδaj·taVa,∑b∈Aδbj·tbVb=∑a∈A∑b∈Aδaj·δbk·σabvab,va,vb∀i∈I,∀j∈Ji,∀k∈Ji.For calculation methods of the mean travel time and travel time variance when each link flow in the network follows a lognormal distribution, the reader is referred to Tani and Uchida [37] in which each link capacity in the network is also assumed to follow a lognormal distribution.


## 3.1. Notation

The notations below are used in this paper.A: Set of links in the networkI: Set of O-D pairs in the networkJi: Set of paths between O-D pair iδaj: Variable that equals 1 if link a is part of path j and equals 0 otherwiseVa: Stochastic flow of link ava: Mean flow of link avab: Mean flow that passes through both links a and bca: Capacity of link aFij: Stochastic flow of path j between O-D pair ifij: Mean flow of path j between O-D pair iQi: Stochastic flow for O-D pair iqi: Mean flow for O-D pair iQ: Stochastic total O-D flowq: Total mean O-D flowpij: Path choice probability for O-D pair i choosing path jpi: Proportion of mean flow for O-D pair i, qi, to total mean flow, qcvi: Coefficient of variation of random flow QiΞij: Stochastic travel time of path j which serves O-D pair icij: Generalized travel time of path j which serves O-D pair i.


## 3.2. Stochastic Traffic Flows

An O-D flow,Qi, is assumed to be a random variable with a mean of EQi=qi and a variance of varQi=cvi·qi2, where cvi is the coefficient of variation of the random flow Qi. Following Lam et al. [33], the stochastic flow on path j∈Ji, Fij, is then given by (9)Fij=pij·Qi∀i∈I,∀j∈Ji.Fij is a random variable with a mean of fij=pij·qi≥0 and a covariance of covFij,Fik=pij·pik·varQi, where pijj∈Ji is path choice probability which can be determined by a path choice model (DUE, SUE, etc.). The following flow conservation law holds for each O-D pair:(10)∑j∈Jifij=qi∀i∈I.The variance of Fij is given by(11)varFij=varpij·Qi=pij2·varQi=cvi·fij2∀i∈I,∀j∈Ji.The conservation of the path flow variance in relation to the O-D flow variance holds (Appendix A). The stochastic flow of link a, Va, is given by(12)Va=∑i∈I∑j∈Jiδaj·Fij∀a∈A.The mean and covariance of the stochastic link flow are then(13)va=∑i∈I∑j∈Jiδaj·fij=∑i∈I∑j∈Jiδaj·pij·qi∀a∈A,(14)covVa,Vb=var∑i∈I∑j∈Jiδaj·δbj·Fij∀a,b∈A,where ∑i∈I∑j∈Jiδaj·δbj·Fij is the sum of all stochastic path flows that pass through both links a and b.


## 3.3. Stochastic Link Travel Time and Stochastic Path Travel Time

In this study, link travel time is represented by the following BPR function [34]:(15)tava=ta0·1+κ·vacaλ∀a∈A,where ta0 is free flow travel time of link a and κ≥0 and λ≥1 are calibration parameters. By substituting va in (15) with Va, we obtain(16)taVa=ta0+κ^a·Vaλ∀a∈A,where κ^a=ta0·κ/caλ.Next, we will show how to calculate both a mean value and variance of the stochastic link travel time shown by (16). By performing an mth-order m≥1 Taylor expansion to (16) at Va=va, we obtain (17)taVa=∑k=0mbka·Va-vak∀a∈A,where bka is the coefficient of the kth term of the Taylor expansion given by(18)bka=1k!·∂ktaVa∂VakVa=va=tavaifk=0κ^a·∏l=1kλ-l+1k!·vaλ-kotherwise.The mean link travel time is then calculated as(19)EtaVa=∑k=0mbka·EVa-vak∀a∈A.The travel time covariance between two links is(20)covtaVa,tbVb=∑k=0m∑l=0mbka·blb·EVa-vak·Vb-vbl-EtaVa·EtbVb∀a,b∈A.As shown in Clark and Watling [6], (19) and (20) can be calculated by applying a method proposed by Isserlis [35] given the moments of Va by assuming that the link flow follows normal distribution [17, 18, 33]. This assumption was supported by Rakha et al. [36], which demonstrated that the normality assumption may be sufficient from a practical standpoint given its computational simplicity. Equation (19) can be calculated as follows:(21)EtaVa=b0a+∑k=1m/2∏l=1k2l-1·b2k,a·varVakm:evennumberb0a+∑k=1m-1/2∏l=1k2l-1·b2k,a·varVakm:oddnumber∀a∈A.The results of m=4 are provided in Appendix B.We now assume that the coefficient of each O-D flow takes a specific value. By applying this assumption to (14) (i.e., cvi=cv∀i∈I), we obtain(22)covVa,Vb=var∑i∈I∑j∈Jiδaj·δbj·Fij=cv·vab2∀a,b∈A,where(23)vab=∑i∈I∑j∈Jiδaj·δbj·fij∀a,b∈A.vab in (23) is the mean flow that passes through both links a and b. If a=b in (22), then we obtain varVa=cv·va2∀a∈A.In fact, this assumption can be justified if we regard total O-D flow in the network,Q=∑i∈IQi, as a random variable with a mean of EQ=q=∑i∈Iqi and a variance of varQ=cv·q2, where Qi=pi·Q. pi=qi/q is the proportion of the O-D flow, qi, to total O-D flow, q. In this case, all O-D flows are statistically dependent on each other. The conservation of the O-D flow variance in relation to the total O-D flow variance holds (Appendix C).By substituting (22) into (19) and (20), we obtain(24)EtaVa=tava+∑k=1∏l=1k2l-1·b^2k,a·vaλ∀a∈A,(25)covtaVa,tbVb=∑k=1mckm·vaλ-k·vbλ-k·vab2k∀a,b∈A,where(26)b^k,a=κ^a·cvk·∏l=1kλ-l+1k!.ckm in (25) is the coefficient for the kth term. The results of m=4 are provided in Appendix D.Note that it is shown from (24) and (25) that the mean, variance, or covariance of link travel time is expressed by using only mean link flow(s) with some given parameters, and it will be shown that both EtaVa and covtaVa,tbVb are increasing functions with respect to va and vab, respectively. It will be shown that these two mathematical properties are convenient for developing a network equilibrium model. The most dominant reason for these two properties is that the coefficients of variation of all O-D flows are assumed to be the same. Thanks to this assumption, any moments for the stochastic link flow can be calculated by using its mean value. Also, as far as the Taylor series expansion provides good approximation, the method presented in this study can be applied to any functional forms. Since the Taylor series expansion can approximate well the function of fx=1/1-x for 0<x≤1, the proposed method can be applied to the Davidson type link cost function. From (25), covtaVa,tbVb>0 if and only if vab>0. From (23), if vab>0, then va>0 and vb>0; however, the inverse relationship does not always hold for any two links in the network (i.e., even though va>0 and vb>0, vab can be zero). These two mathematical properties show that the travel time covariance of two links, covtaVa,tbVb, is greater than zero if and only if vab is greater than zero and that va and va can influence the travel time covariance of two links, covtaVa,tbVb, if and only if vab is greater than zero. Therefore, a calculation of vab is important to calculate covtaVa,tbVb in the network. As discussed in the next section, the calculation of vab for two adjacent links in the network is easily implemented since there is no need to enumerate a path set in the network. In contrast, the calculation of vab for two unconnected links in the network becomes more difficult than that for two adjacent links since that may need to enumerate a path set in the network.For notational simplicity, in the rest of the paper,EtaVa, vartaVa, and covtaVa,tbVb are denoted by t^ava, σa2va, and σabvab;va,vb, respectively. The travel time of path j which serves O-D pair i (Ξij) is given by (27)Ξij=∑a∈AtaVa·δaj∀i∈I,∀j∈Ji.The mean path travel time and path travel time variance are, respectively, given by(28)EΞij=E∑a∈AtaVa·δaj=∑a∈At^ava·δaj∀i∈I,∀j∈Ji,varΞij=var∑a∈AtaVa·δaj=∑a∈A∑b∈Aδaj·δbj·σabvab,va,vb=∑a∈Aσa2va·δaj+2∑a∈A∑b≠a∈Aδaj·δbj·σabvab,va,vb∀i∈I,∀j∈Ji.The path travel time covariance is(29)covΞij,Ξik=cov∑a∈Aδaj·taVa,∑b∈Aδbj·tbVb=∑a∈A∑b∈Aδaj·δbk·σabvab,va,vb∀i∈I,∀j∈Ji,∀k∈Ji.For calculation methods of the mean travel time and travel time variance when each link flow in the network follows a lognormal distribution, the reader is referred to Tani and Uchida [37] in which each link capacity in the network is also assumed to follow a lognormal distribution.


## 4. Network Equilibrium Model under Stochastic Flows

### 4.1. DUE Principle

A risk-averse driver may take into account both a mean travel time and travel time variability in his/her path choice decision. Travel time variance is employed as a measure of the travel time variability in this study. The generalized travel time of pathj which serves O-D pair i (Ξij) is defined as(30)cij=EΞij+ω·varΞij,where ω≥0 is a relative weight assigned to varΞij. The risk-averse driver assumed in this study chooses the path with lower path travel time variance if the mean path travel times of all the alternative paths are the same. Such risk-averse driver’s path choice problem based on the DUE principle can be formulated as follows:(31)cij∗=πiiffij∗>0,cij∗≥πiiffij∗=0∀i∈I,∀j∈Ji,subject to (10), (13), and (23), where πi is the minimum generalized travel time of O-D pair i. The superscript ∗ is used to denote the variables that are obtained at equilibrium. It is known that this problem is equivalent to the following nonlinear complementary problem (NCP):(32)fij∗·cij∗-πi=0,cij∗-πi≥0,fij∗≥0∀i∈I,∀j∈Ji,subject to (10), (13), and (23). The equilibrium path flows can be obtained by solving the following variational inequality (VI) problem [38].Findf∗∈Ωf such that(33)∑i∈I∑j∈Jifij-fij∗·cij∗≥0,∀f∈Ωf,where Ωf=f∣∑j∈Jifij=qi∀i∈I,fij≥0∀i∈I,∀j∈Ji and f=fiji∈I,j∈Ji.There are efficient solution algorithms for solving the DUE traffic assignment problem. However, most of such algorithms cannot be applied to solve the VI problem shown above in which the path travel time variance is nonadditive due to the link travel time covariance between two links in the network. Therefore, path-based solution algorithms [39] which, in general, require enumeration of a path set need to be applied in order to solve the VI problem. However, the enumeration of all possible paths is almost impossible for the case of a large network. Therefore, in the next section, we will propose a simplified network model in which only the covariance terms between two adjacent links in the network are taken into account in calculating the path travel variance by considering practicality. Thus, an efficient link-based algorithm for DUE traffic assignment problem can be applied to the simplified network model.


### 4.2. Simplification

Paths enumeration may be required for solving the VI problem presented in the previous section. Enumeration of all noncyclic paths in a large road network is impossible. From a practical standpoint, it may be reasonable to enumerate several paths for each O-D pair (e.g., two or three paths for each O-D pair). However, different solutions can be obtained depending on paths enumerated, and that may be a troublesome issue in estimating the benefit of a project.If we assume that the link travel time follows an independent distribution, then path travel time variance is the sum of the link travel time variance related to that path. In this case, the path choice problem can be formulated as the following convex programming problem:(34)min⁡z=∑a∈A∫0vagawdw,subject to (10), (13), and (23), where gava=t^ava+ω·σa2va. This problem has the same mathematical structure as the standard DUE traffic assignment model and thus can be solved easily by applying standard link-based algorithms (MSA (Method of Successive Averages), the Frank-Wolfe algorithm, etc.) [40]. However, ignoring all travel time covariance in (28) may bring about unrealistic solutions.Rakha et al. [36] presented extensive evidence of a significant correlation between travel times of two adjacent links in the network. Although they analyzed travel time variability over vehicles, this evidence may support travel time variability over days. By utilizing this evidence, we now take into account all travel time covariance between two adjacent links in the network when calculating the path travel time variance. The corresponding path choice problem can be then formulated as the following link-based VI problem: simplified network model (SNM).Findv∗∈Ωv and v^∗∈Ωv^ such that(35)∑a∈Ava-va∗·gava∗+∑b∈θavab-vab∗·gabvab∗,va∗,vb∗≥0,∀v∈Ωv,∀v^∈Ωv^,where(36)gabvab,va,vb=2·ω·σabvab,va,vbΩv=v∣va=∑i∈I∑j∈Jiδaj·fij∀f∈Ωf,∀a∈A,Ωv^=v^∣vab=∑i∈I∑j∈Jiδaj·δaj·fij∀f∈Ωf,∀a∈A,∀b∈θa,v=vaa∈A,v^=vaba∈A,b∈θa.θa is the set of links which are adjacent to link a in front of it. SNM includes no stochastic variable, although SNM analyzes travel time reliability in the network.To solve SNM, one can apply a network representation which may be used when addressing intersection delays, in which dummy links connecting between all adjacent links in the network are added to the original network. Consider an original network that consists of a set of links and a set of nodes. It is assumed that each node in the network also has an identical number. Consider then a directed link in the original network. We can find each link of which origin node number is the same as the destination node of the link. By using this relationship, we can construct the augmented network (e.g., right-hand side of Figure2), that corresponds to the original network (e.g., left-hand side of Figure 2), by inserting a directed dummy link between these two links. In the augmented network, the generalized travel time of link a∀a∈A is gava and that of dummy link ab∀a∈A,∀b∈θa is gabvab,va,vb. Once the augmented network is constructed, vab is easily calculated as the flow of link ab. By applying this network representation, SNM can be solved by a diagonalization method in which va and vb in gabvab,va,vb are regarded as constant terms [41–45]. Also, MSA can be applied for solving SNM. Due to the mathematical structure of gabvab,va,vb, however, SNM has the same mathematical property as an asymmetric DUE traffic assignment problem which can have multiple solutions. Therefore, SNM may have multiple solutions. Next, we will examine the uniqueness of the solution of SNM.Figure 2
Network representation for addressing intersection delays.If both generalized link travel time functions,gava∀a∈A and gabvab,va,vb∀a∈A,∀b∈θa, in the augmented network are monotone functions, SNM has a unique solution. Or equivalently, if the Jacobian matrix ∇gv,v^, where g=gaa∈A,gaba∈A,b∈θa, is positive-definite, SNM has a unique solution. The Jacobian matrix ∇gv,v^ is given by the following lower triangle matrix:(37)∇gv,v^=dg1dv10⋱000dgAdvA∂g1,θ1∂v1⋯∂g1,θ1∂vθ1⋯0∂g1,θ1∂v1,θ1⋮⋮⋮⋮⋱0⋯∂gA,θA∂vθA⋯∂gA,θA∂vA0⋯∂gA,θA∂vA,θA.If every eigenvalue of a Jacobian matrix is positive, the Jacobian matrix is positive-definite. The eigenvalues of a lower triangle matrix are equal to the values of diagonal elements of the matrix. In SNM, the following two conditions hold for each link in the augmented network (see Appendix E for the proofs):(38)∂gabvab,va,vb∂vab>0∀a,b∈A,∂gava∂va>0∀a∈A.Therefore, ∇gv,v^ is positive-definite and thus SNM has a unique solution. If the link travel time covariance for any two links in the network is taken into consideration in calculating path travel time variance, the uniqueness of the solution is not obtained.Since SNM calculates the stochastic variables at the equilibrium, the stability as well as the uniqueness of the solution is guaranteed in SNM. Even in a problem in a static context, the stability and uniqueness of the solution can be analyzed by applying theory in a dynamic context. This is true for our static problem.


## 4.1. DUE Principle

A risk-averse driver may take into account both a mean travel time and travel time variability in his/her path choice decision. Travel time variance is employed as a measure of the travel time variability in this study. The generalized travel time of pathj which serves O-D pair i (Ξij) is defined as(30)cij=EΞij+ω·varΞij,where ω≥0 is a relative weight assigned to varΞij. The risk-averse driver assumed in this study chooses the path with lower path travel time variance if the mean path travel times of all the alternative paths are the same. Such risk-averse driver’s path choice problem based on the DUE principle can be formulated as follows:(31)cij∗=πiiffij∗>0,cij∗≥πiiffij∗=0∀i∈I,∀j∈Ji,subject to (10), (13), and (23), where πi is the minimum generalized travel time of O-D pair i. The superscript ∗ is used to denote the variables that are obtained at equilibrium. It is known that this problem is equivalent to the following nonlinear complementary problem (NCP):(32)fij∗·cij∗-πi=0,cij∗-πi≥0,fij∗≥0∀i∈I,∀j∈Ji,subject to (10), (13), and (23). The equilibrium path flows can be obtained by solving the following variational inequality (VI) problem [38].Findf∗∈Ωf such that(33)∑i∈I∑j∈Jifij-fij∗·cij∗≥0,∀f∈Ωf,where Ωf=f∣∑j∈Jifij=qi∀i∈I,fij≥0∀i∈I,∀j∈Ji and f=fiji∈I,j∈Ji.There are efficient solution algorithms for solving the DUE traffic assignment problem. However, most of such algorithms cannot be applied to solve the VI problem shown above in which the path travel time variance is nonadditive due to the link travel time covariance between two links in the network. Therefore, path-based solution algorithms [39] which, in general, require enumeration of a path set need to be applied in order to solve the VI problem. However, the enumeration of all possible paths is almost impossible for the case of a large network. Therefore, in the next section, we will propose a simplified network model in which only the covariance terms between two adjacent links in the network are taken into account in calculating the path travel variance by considering practicality. Thus, an efficient link-based algorithm for DUE traffic assignment problem can be applied to the simplified network model.


## 4.2. Simplification

Paths enumeration may be required for solving the VI problem presented in the previous section. Enumeration of all noncyclic paths in a large road network is impossible. From a practical standpoint, it may be reasonable to enumerate several paths for each O-D pair (e.g., two or three paths for each O-D pair). However, different solutions can be obtained depending on paths enumerated, and that may be a troublesome issue in estimating the benefit of a project.If we assume that the link travel time follows an independent distribution, then path travel time variance is the sum of the link travel time variance related to that path. In this case, the path choice problem can be formulated as the following convex programming problem:(34)min⁡z=∑a∈A∫0vagawdw,subject to (10), (13), and (23), where gava=t^ava+ω·σa2va. This problem has the same mathematical structure as the standard DUE traffic assignment model and thus can be solved easily by applying standard link-based algorithms (MSA (Method of Successive Averages), the Frank-Wolfe algorithm, etc.) [40]. However, ignoring all travel time covariance in (28) may bring about unrealistic solutions.Rakha et al. [36] presented extensive evidence of a significant correlation between travel times of two adjacent links in the network. Although they analyzed travel time variability over vehicles, this evidence may support travel time variability over days. By utilizing this evidence, we now take into account all travel time covariance between two adjacent links in the network when calculating the path travel time variance. The corresponding path choice problem can be then formulated as the following link-based VI problem: simplified network model (SNM).Findv∗∈Ωv and v^∗∈Ωv^ such that(35)∑a∈Ava-va∗·gava∗+∑b∈θavab-vab∗·gabvab∗,va∗,vb∗≥0,∀v∈Ωv,∀v^∈Ωv^,where(36)gabvab,va,vb=2·ω·σabvab,va,vbΩv=v∣va=∑i∈I∑j∈Jiδaj·fij∀f∈Ωf,∀a∈A,Ωv^=v^∣vab=∑i∈I∑j∈Jiδaj·δaj·fij∀f∈Ωf,∀a∈A,∀b∈θa,v=vaa∈A,v^=vaba∈A,b∈θa.θa is the set of links which are adjacent to link a in front of it. SNM includes no stochastic variable, although SNM analyzes travel time reliability in the network.To solve SNM, one can apply a network representation which may be used when addressing intersection delays, in which dummy links connecting between all adjacent links in the network are added to the original network. Consider an original network that consists of a set of links and a set of nodes. It is assumed that each node in the network also has an identical number. Consider then a directed link in the original network. We can find each link of which origin node number is the same as the destination node of the link. By using this relationship, we can construct the augmented network (e.g., right-hand side of Figure2), that corresponds to the original network (e.g., left-hand side of Figure 2), by inserting a directed dummy link between these two links. In the augmented network, the generalized travel time of link a∀a∈A is gava and that of dummy link ab∀a∈A,∀b∈θa is gabvab,va,vb. Once the augmented network is constructed, vab is easily calculated as the flow of link ab. By applying this network representation, SNM can be solved by a diagonalization method in which va and vb in gabvab,va,vb are regarded as constant terms [41–45]. Also, MSA can be applied for solving SNM. Due to the mathematical structure of gabvab,va,vb, however, SNM has the same mathematical property as an asymmetric DUE traffic assignment problem which can have multiple solutions. Therefore, SNM may have multiple solutions. Next, we will examine the uniqueness of the solution of SNM.Figure 2
Network representation for addressing intersection delays.If both generalized link travel time functions,gava∀a∈A and gabvab,va,vb∀a∈A,∀b∈θa, in the augmented network are monotone functions, SNM has a unique solution. Or equivalently, if the Jacobian matrix ∇gv,v^, where g=gaa∈A,gaba∈A,b∈θa, is positive-definite, SNM has a unique solution. The Jacobian matrix ∇gv,v^ is given by the following lower triangle matrix:(37)∇gv,v^=dg1dv10⋱000dgAdvA∂g1,θ1∂v1⋯∂g1,θ1∂vθ1⋯0∂g1,θ1∂v1,θ1⋮⋮⋮⋮⋱0⋯∂gA,θA∂vθA⋯∂gA,θA∂vA0⋯∂gA,θA∂vA,θA.If every eigenvalue of a Jacobian matrix is positive, the Jacobian matrix is positive-definite. The eigenvalues of a lower triangle matrix are equal to the values of diagonal elements of the matrix. In SNM, the following two conditions hold for each link in the augmented network (see Appendix E for the proofs):(38)∂gabvab,va,vb∂vab>0∀a,b∈A,∂gava∂va>0∀a∈A.Therefore, ∇gv,v^ is positive-definite and thus SNM has a unique solution. If the link travel time covariance for any two links in the network is taken into consideration in calculating path travel time variance, the uniqueness of the solution is not obtained.Since SNM calculates the stochastic variables at the equilibrium, the stability as well as the uniqueness of the solution is guaranteed in SNM. Even in a problem in a static context, the stability and uniqueness of the solution can be analyzed by applying theory in a dynamic context. This is true for our static problem.


## 5. Numerical Experiments

### 5.1. Settings

In this section, we carry out numerical experiments for illustrating the application and validity of SNM. We adopt the network of Nguyen and Dupuis [46] with 4 O-D pairs, 25 paths, and 19 directed links (Figure 3). The link sequences of the paths are shown in Table 1.Table 1
Paths and link sequences.
O-D
O-D pair
Path
Link seq.
(
1
)
1-2
(
1
)
2-18-11
(
2
)
1-5-7-9-11
(
3
)
1-5-7-10-15
(
4
)
1-5-8-14-15
(
5
)
1-6-12-14-15
(
6
)
2-17-7-9-11
(
7
)
2-17-7-10-15
(
8
)
2-17-8-14-15
(
2
)
4-2
(
9
)
4-12-14-15
(
10
)
3-5-7-9-11
(
11
)
3-5-7-10-15
(
12
)
3-5-8-14-15
(
13
)
3-6-12-14-15
(
3
)
1-3
(
14
)
1-6-13-19
(
15
)
1-5-7-10-16
(
16
)
1-5-8-14-16
(
17
)
1-6-12-14-16
(
18
)
2-17-7-10-16
(
19
)
2-17-8-14-16
(
4
)
4-3
(
20
)
4-13-19
(
21
)
4-12-14-16
(
22
)
3-6-13-19
(
23
)
3-5-7-10-16
(
24
)
3-5-8-14-16
(
25
)
3-6-12-14-16Figure 3
The Nguyen and Dupuis network.We employed the mean link travel time and travel time covariance shown in (24) and (25) that are calculated by assuming m=4, respectively. Parameters for the BPR function, κ and λ, are 2.62 and 5, respectively. The coefficient of variation of total O-D flow, cv, is 0.1. The other parameters used in (24) and (25) are shown in Table 2.Table 2
Link travel time parameters.
Link
Free-flow travel time
Capacity
t
a
0
c
a
(
1
)
10
1500
(
2
)
10
1500
(
3
)
10
1500
(
4
)
20
1500
(
5
)
10
1500
(
6
)
10
1500
(
7
)
10
1500
(
8
)
10
1500
(
9
)
10
1500
(
10
)
10
1500
(
11
)
10
1500
(
12
)
10
1500
(
13
)
20
1500
(
14
)
10
1500
(
15
)
10
1500
(
16
)
10
1500
(
17
)
10
1500
(
18
)
40
1500
(
19
)
10
1500In this study, we prepared four experimental cases by changing the effect of the path travel time variance on the driver’s path choice behavior in the network. In the first case, we assume a risk-neutral driver who chooses a path based only on mean path travel time in the network. Therefore, the relative weight assigned to path travel time variance,ω, in (30) is 0 in this case. The other three cases assume three types of risk-averse drivers. The relative weight assigned to varΞij is assumed as 0.3 in these three cases. In the second case, we assume that there is no travel time correlation between two different links in the network. In the third case, SNM is employed (i.e., all travel time covariance between two adjacent links in the network is introduced to calculate the path travel time variance). In the fourth case, all travel time covariance between two different links in the network is introduced to calculate the path travel time variance. In the latter three cases, the path travel time variance is calculated as(39)varΞij=∑a∈A∑b∈BcovtaVa,tbVb·δaj·δbj∀i∈I,∀j∈Jiby using both the relative weight assigned to path travel time variance, ω, and the set of link(s), B, shown in Table 3.Table 3
Assumptions of each case.
Case
Relative weight (ω)
Set of link(s) (B)
2
0.3
a
3
0.3
θ
a
4
0.3
AFor solving the first three cases, we employed MSA as a link-based solution algorithm. The final case can be solved by minimizing the gap function for NCP [17, 47, 48]. In fact, the paths set shown in Table 1 is prepared only for the final case. Only case  4 cannot be solved by MSA which does not require paths enumeration and thus is applicable to a large network. On the other hand, it is difficult to solve the problem of a large network using the method based on the gap function that requires paths enumeration.


### 5.2. Results

Table4 shows the mean path flows for each case. For the first three cases, since we applied MSA to solve corresponding path choice problems, the path flows for each case were not uniquely determined. Even so, presenting path flows for the first three cases may be useful to understand roughly how path flows change according to different expressions of path travel time variance. Also, by presenting the path flows for cases 1–3 to which MSA was applied, it is easy to understand that the generalized travel times for the paths between each O-D pair that are used by the drivers are the same although both the mean travel time and travel time variance of a path between the O-D pair can be different from the others. In contrast, the path flows for case  4 were uniquely determined, since we applied a path-based algorithm when solving its path choice problem. In all cases, if a path flow is zero, such path flow is denoted by bold figures in Table 4 so that we can know that the corresponding path is not chosen by the drivers in the network. Table 5 shows generalized path travel times for all cases which are calculated by using both the mean path travel times shown in Table 6 and the path travel time variance shown in Table 7. It is observed that the paths chosen by the drivers have the minimum generalized travel time and that the paths which are not chosen by the drivers have generalized travel times which are equal to or greater than the minimum generalized travel time. The generalized path travel times for unused paths are denoted by bold figures in Table 5. It is shown in Tables 4, 6, and 8 that although the mean path flows of each case are different from the other cases, mean link flows are similar among all cases. Since mean travel time of a path is calculated by using mean link flows, therefore similar mean path travel times are obtained among the four cases.Table 4
Mean path flows.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
499
658
643
641
(
2
)
81
58
0
75
(
3
)
88
64
165
117
(
4
)
45
47
0
0
(
5
)
112
59
61
0
(
6
)
22
76
88
0
(
7
)
127
38
42
168
(
8
)
25
0
0
0
(
2
)
(
9
)
265
276
491
321
(
10
)
411
229
294
313
(
11
)
157
236
173
88
(
12
)
16
126
0
127
(
13
)
151
133
41
152
(
3
)
(
14
)
317
413
304
268
(
15
)
79
107
45
100
(
16
)
36
58
296
210
(
17
)
145
108
24
122
(
18
)
248
255
330
296
(
19
)
174
59
0
5
(
4
)
(
20
)
591
491
441
481
(
21
)
121
197
28
155
(
22
)
149
120
273
268
(
23
)
0
87
18
0
(
24
)
96
4
30
0
(
25
)
43
100
210
97Table 5
Generalized path travel time.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
70.5
75.9
77.5
80.0
(
2
)
70.5
75.9
77.5
80.0
(
3
)
70.5
75.9
77.5
80.0
(
4
)
70.5
75.9
77.5
80.1
(
5
)
70.5
75.9
77.5
80.2
(
6
)
70.5
75.9
77.5
81.1
(
7
)
70.5
75.9
77.5
80.0
(
8
)
70.5
75.9
78.5
80.1
(
2
)
(
9
)
72.5
79.1
81.3
85.1
(
10
)
72.5
79.1
81.3
85.1
(
11
)
72.5
79.1
81.3
85.1
(
12
)
72.5
79.1
81.3
85.1
(
13
)
72.5
79.1
81.3
85.1
(
3
)
(
14
)
69.8
75.8
77.7
80.6
(
15
)
69.8
75.8
77.7
80.6
(
16
)
69.8
75.8
77.7
80.6
(
17
)
69.8
75.8
77.7
80.6
(
18
)
69.8
75.8
77.7
80.6
(
19
)
69.8
75.8
78.7
80.6
(
4
)
(
20
)
71.8
79.0
81.5
85.1
(
21
)
71.8
79.0
81.5
85.1
(
22
)
71.8
79.0
81.5
85.1
(
23
)
71.8
79.0
81.5
85.2
(
24
)
71.8
79.0
81.5
85.1
(
25
)
71.8
79.0
81.5
85.1Table 6
Mean path travel time.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
70.5
71.8
72.2
72.4
(
2
)
70.5
68.5
68.6
68.7
(
3
)
70.5
68.8
68.7
68.6
(
4
)
70.5
68.2
68.5
68.8
(
5
)
70.5
68.7
68.4
68.4
(
6
)
70.5
67.7
68.5
68.7
(
7
)
70.5
68.0
68.6
68.6
(
8
)
70.5
67.5
68.4
68.8
(
2
)
(
9
)
72.5
69.9
70.0
70.0
(
10
)
72.5
70.6
71.1
71.3
(
11
)
72.5
70.9
71.1
71.2
(
12
)
72.5
70.3
70.9
71.4
(
13
)
72.5
70.8
70.8
71.0
(
3
)
(
14
)
69.8
68.0
67.2
66.8
(
15
)
69.8
68.7
68.8
68.8
(
16
)
69.8
68.2
68.6
69.0
(
17
)
69.8
68.6
68.5
68.6
(
18
)
69.8
68.0
68.7
68.8
(
19
)
69.8
67.4
68.5
69.0
(
4
)
(
20
)
71.8
69.2
68.8
68.4
(
21
)
71.8
69.8
70.1
70.2
(
22
)
71.8
70.1
69.6
69.4
(
23
)
71.8
70.9
71.2
71.4
(
24
)
71.8
70.3
71.0
71.6
(
25
)
71.8
70.7
71.0
71.2Table 7
Path travel time variance.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
0.0
13.5
17.6
25.5
(
2
)
0.0
24.8
29.6
37.8
(
3
)
0.0
23.6
29.5
38.0
(
4
)
0.0
25.6
30.1
37.8
(
5
)
0.0
24.0
30.4
39.3
(
6
)
0.0
27.3
30.0
41.3
(
7
)
0.0
26.2
29.8
38.1
(
8
)
0.0
28.1
33.6
37.8
(
2
)
(
9
)
0.0
30.7
37.8
50.4
(
10
)
0.0
28.5
34.3
46.0
(
11
)
0.0
27.3
34.2
46.3
(
12
)
0.0
29.2
34.8
45.8
(
13
)
0.0
27.7
35.0
47.2
(
3
)
(
14
)
0.0
26.1
35.1
46.2
(
15
)
0.0
23.5
29.7
39.3
(
16
)
0.0
25.5
30.3
38.8
(
17
)
0.0
23.9
30.6
40.2
(
18
)
0.0
26.1
30.0
39.4
(
19
)
0.0
28.0
33.9
38.9
(
4
)
(
20
)
0.0
32.8
42.6
55.7
(
21
)
0.0
30.6
38.0
49.7
(
22
)
0.0
29.8
39.8
52.5
(
23
)
0.0
27.2
34.4
46.0
(
24
)
0.0
29.1
35.0
45.2
(
25
)
0.0
27.6
35.2
46.5Table 8
Mean link flows.
Link
Case  1
Case  2
Case  3
Case  4
(
1
)
904
914
896
890
(
2
)
1,096
1,086
1,104
1,110
(
3
)
1,024
1,036
1,040
1,044
(
4
)
976
964
960
956
(
5
)
1,010
1,017
1,021
1,028
(
6
)
918
933
914
906
(
7
)
1,215
1,151
1,157
1,155
(
8
)
392
295
325
342
(
9
)
514
363
383
387
(
10
)
701
788
774
768
(
11
)
1,013
1,021
1,026
1,028
(
12
)
837
873
855
846
(
13
)
1,057
1,024
1,019
1,016
(
14
)
1,229
1,167
1,181
1,188
(
15
)
987
979
974
972
(
16
)
943
976
981
984
(
17
)
597
428
461
469
(
18
)
499
658
643
641
(
19
)
1,057
1,024
1,019
1,016For O-D pair 1, the flows of paths 4, 5, and 8 in cases 2–4 are smaller than those in case 1 whereas the flows of path 1 in cases 2–4 are larger than that in case 1. These differences can be explained as follows. The travel time variances of path 1 in cases 2–4, which are denoted by bold figures in Table7, are much smaller than those of paths 2–8, although the mean travel time of path 1 is longer than those of paths 2–8, which are denoted by bold figures in Table 6. However, path 1 has longer mean travel time than paths 2–8, and that path is more reliable in terms of travel time variance than paths 2–8 in cases 2–4. In total, the path choice probabilities of path 1 in cases 2–4 are larger than that in case  1. In contrast, since the drivers in case  1 choose their paths based only on mean travel times, the flow of path 1 is larger than those in cases 2–4. This path choice switch can be observed in the other O-D pairs (e.g., from path 10 to path 9 for O-D pair 2, from paths 17 and 19 to paths 16 and 18 for O-D pair 3, and from paths 20 and 24 to path 25 for O-D pair 4.We can find from Table6 a tendency of the mean path travel time in case  1 to be greater than those in cases 2–4. Surprisingly, this tendency holds for all paths in the network except for path 1. Obviously, this tendency was derived from the introduction of travel time variance to the drivers’ path choice behavior. We will then check how total mean travel time in the network is shortened by the introduction of travel time variance. An index for the total mean travel time for cases n∈1,…,4, TTTn, can be given by(40)TTTn=∑a∈At^ava·va.By using both the mean link flows shown in Table 8 and the mean link travel time shown in Table 9, TTTn∀n∈1,…,4 are calculated as 2.847×105, 2.789×105, 2.797×105, and 2.794×105, respectively. An introduction of travel time variance to the path choice behavior model may bring about an efficient use of the road network in terms of the mean travel time. This effect is similar to the one obtained by applying the system optimal principle (i.e., Wardrop’s second principle). From the mean link flows shown in Table 8, it is observed that the mean flows of links 5, 9, 11, 12, 16, and 18 in cases 2–4 are larger than those in case  1, whereas those of links 4, 7, 8, 13, 14, 15, and 17 in cases 2–4 are smaller than those in case  1. These changes happened by the path flow changes in cases 1–4 which we have discussed.Table 9
Mean link travel time.
Link
Case  1
Case  2
Case  3
Case  4
(
1
)
12.3
12.4
12.2
12.1
(
2
)
16.0
15.7
16.2
16.4
(
3
)
14.3
14.5
14.6
14.7
(
4
)
26.7
26.3
26.2
26.1
(
5
)
14.0
14.1
14.2
14.4
(
6
)
12.5
12.7
12.4
12.3
(
7
)
20.0
17.7
17.9
17.8
(
8
)
10.0
10.0
10.0
10.0
(
9
)
10.1
10.0
10.0
10.0
(
10
)
10.6
11.2
11.1
11.0
(
11
)
14.1
14.2
14.3
14.4
(
12
)
11.6
11.9
11.7
11.6
(
13
)
30.0
28.6
28.4
28.2
(
14
)
20.7
18.2
18.7
19.0
(
15
)
13.6
13.4
13.3
13.3
(
16
)
12.8
13.4
13.4
13.5
(
17
)
10.3
10.1
10.1
10.1
(
18
)
40.5
41.9
41.7
41.6
(
19
)
15.0
14.3
14.2
14.1As discussed in the previous section, if we do not consider the effect of travel time reliability on the driver’s path choice behavior in the network, unrealistic results may be obtained. However, the introduction of all travel time covariance between two different links in the network to the calculation of the path travel time variance is difficult to implement. Therefore, we proposed SNM, in which all travel time covariance between two adjacent links in the network is considered in calculating the path travel time variance. Our concern is now how far the results obtained in cases 1–3 are from the results obtained in case  4. The results obtained in case  4 can be regarded as the exact solution, since it is obtained by adopting the path travel time variance denoted by (28). Table 10 shows the coefficients of correlation of mean link flows among four cases. The bold figures in the table show the coefficients of correlation between case  4 and the other three cases. One can see that SNM (case  3) reproduces almost the same mean link flows as case  4, since the coefficient of correlation between case  4 and case  3 is 1 whereas the other coefficients of correlation are less than 1. Note that the coefficient of correlation between case  4 and case  1 is the smallest. Almost the same results were obtained by calculating the coefficients of correlation of mean link travel times. These results may bring about two practical implications that all travel time covariance between two different links in the network may not be required in calculating mean link flows. Instead, all travel time covariance between two adjacent links in the network is required in calculating mean link flows, and that calculation of all travel time covariance between two adjacent links in the network is easy even in a large network.Table 10
Coefficients of correlation of mean link flows.
Case  1
Case  2
Case  3
Case  4
Case  1
1.000
Case  2
0.957
1.000
Case  3
0.973
0.995
1.000
Case  4
0.969
0.997
1.000
1.000


## 5.1. Settings

In this section, we carry out numerical experiments for illustrating the application and validity of SNM. We adopt the network of Nguyen and Dupuis [46] with 4 O-D pairs, 25 paths, and 19 directed links (Figure 3). The link sequences of the paths are shown in Table 1.Table 1
Paths and link sequences.
O-D
O-D pair
Path
Link seq.
(
1
)
1-2
(
1
)
2-18-11
(
2
)
1-5-7-9-11
(
3
)
1-5-7-10-15
(
4
)
1-5-8-14-15
(
5
)
1-6-12-14-15
(
6
)
2-17-7-9-11
(
7
)
2-17-7-10-15
(
8
)
2-17-8-14-15
(
2
)
4-2
(
9
)
4-12-14-15
(
10
)
3-5-7-9-11
(
11
)
3-5-7-10-15
(
12
)
3-5-8-14-15
(
13
)
3-6-12-14-15
(
3
)
1-3
(
14
)
1-6-13-19
(
15
)
1-5-7-10-16
(
16
)
1-5-8-14-16
(
17
)
1-6-12-14-16
(
18
)
2-17-7-10-16
(
19
)
2-17-8-14-16
(
4
)
4-3
(
20
)
4-13-19
(
21
)
4-12-14-16
(
22
)
3-6-13-19
(
23
)
3-5-7-10-16
(
24
)
3-5-8-14-16
(
25
)
3-6-12-14-16Figure 3
The Nguyen and Dupuis network.We employed the mean link travel time and travel time covariance shown in (24) and (25) that are calculated by assuming m=4, respectively. Parameters for the BPR function, κ and λ, are 2.62 and 5, respectively. The coefficient of variation of total O-D flow, cv, is 0.1. The other parameters used in (24) and (25) are shown in Table 2.Table 2
Link travel time parameters.
Link
Free-flow travel time
Capacity
t
a
0
c
a
(
1
)
10
1500
(
2
)
10
1500
(
3
)
10
1500
(
4
)
20
1500
(
5
)
10
1500
(
6
)
10
1500
(
7
)
10
1500
(
8
)
10
1500
(
9
)
10
1500
(
10
)
10
1500
(
11
)
10
1500
(
12
)
10
1500
(
13
)
20
1500
(
14
)
10
1500
(
15
)
10
1500
(
16
)
10
1500
(
17
)
10
1500
(
18
)
40
1500
(
19
)
10
1500In this study, we prepared four experimental cases by changing the effect of the path travel time variance on the driver’s path choice behavior in the network. In the first case, we assume a risk-neutral driver who chooses a path based only on mean path travel time in the network. Therefore, the relative weight assigned to path travel time variance,ω, in (30) is 0 in this case. The other three cases assume three types of risk-averse drivers. The relative weight assigned to varΞij is assumed as 0.3 in these three cases. In the second case, we assume that there is no travel time correlation between two different links in the network. In the third case, SNM is employed (i.e., all travel time covariance between two adjacent links in the network is introduced to calculate the path travel time variance). In the fourth case, all travel time covariance between two different links in the network is introduced to calculate the path travel time variance. In the latter three cases, the path travel time variance is calculated as(39)varΞij=∑a∈A∑b∈BcovtaVa,tbVb·δaj·δbj∀i∈I,∀j∈Jiby using both the relative weight assigned to path travel time variance, ω, and the set of link(s), B, shown in Table 3.Table 3
Assumptions of each case.
Case
Relative weight (ω)
Set of link(s) (B)
2
0.3
a
3
0.3
θ
a
4
0.3
AFor solving the first three cases, we employed MSA as a link-based solution algorithm. The final case can be solved by minimizing the gap function for NCP [17, 47, 48]. In fact, the paths set shown in Table 1 is prepared only for the final case. Only case  4 cannot be solved by MSA which does not require paths enumeration and thus is applicable to a large network. On the other hand, it is difficult to solve the problem of a large network using the method based on the gap function that requires paths enumeration.


## 5.2. Results

Table4 shows the mean path flows for each case. For the first three cases, since we applied MSA to solve corresponding path choice problems, the path flows for each case were not uniquely determined. Even so, presenting path flows for the first three cases may be useful to understand roughly how path flows change according to different expressions of path travel time variance. Also, by presenting the path flows for cases 1–3 to which MSA was applied, it is easy to understand that the generalized travel times for the paths between each O-D pair that are used by the drivers are the same although both the mean travel time and travel time variance of a path between the O-D pair can be different from the others. In contrast, the path flows for case  4 were uniquely determined, since we applied a path-based algorithm when solving its path choice problem. In all cases, if a path flow is zero, such path flow is denoted by bold figures in Table 4 so that we can know that the corresponding path is not chosen by the drivers in the network. Table 5 shows generalized path travel times for all cases which are calculated by using both the mean path travel times shown in Table 6 and the path travel time variance shown in Table 7. It is observed that the paths chosen by the drivers have the minimum generalized travel time and that the paths which are not chosen by the drivers have generalized travel times which are equal to or greater than the minimum generalized travel time. The generalized path travel times for unused paths are denoted by bold figures in Table 5. It is shown in Tables 4, 6, and 8 that although the mean path flows of each case are different from the other cases, mean link flows are similar among all cases. Since mean travel time of a path is calculated by using mean link flows, therefore similar mean path travel times are obtained among the four cases.Table 4
Mean path flows.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
499
658
643
641
(
2
)
81
58
0
75
(
3
)
88
64
165
117
(
4
)
45
47
0
0
(
5
)
112
59
61
0
(
6
)
22
76
88
0
(
7
)
127
38
42
168
(
8
)
25
0
0
0
(
2
)
(
9
)
265
276
491
321
(
10
)
411
229
294
313
(
11
)
157
236
173
88
(
12
)
16
126
0
127
(
13
)
151
133
41
152
(
3
)
(
14
)
317
413
304
268
(
15
)
79
107
45
100
(
16
)
36
58
296
210
(
17
)
145
108
24
122
(
18
)
248
255
330
296
(
19
)
174
59
0
5
(
4
)
(
20
)
591
491
441
481
(
21
)
121
197
28
155
(
22
)
149
120
273
268
(
23
)
0
87
18
0
(
24
)
96
4
30
0
(
25
)
43
100
210
97Table 5
Generalized path travel time.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
70.5
75.9
77.5
80.0
(
2
)
70.5
75.9
77.5
80.0
(
3
)
70.5
75.9
77.5
80.0
(
4
)
70.5
75.9
77.5
80.1
(
5
)
70.5
75.9
77.5
80.2
(
6
)
70.5
75.9
77.5
81.1
(
7
)
70.5
75.9
77.5
80.0
(
8
)
70.5
75.9
78.5
80.1
(
2
)
(
9
)
72.5
79.1
81.3
85.1
(
10
)
72.5
79.1
81.3
85.1
(
11
)
72.5
79.1
81.3
85.1
(
12
)
72.5
79.1
81.3
85.1
(
13
)
72.5
79.1
81.3
85.1
(
3
)
(
14
)
69.8
75.8
77.7
80.6
(
15
)
69.8
75.8
77.7
80.6
(
16
)
69.8
75.8
77.7
80.6
(
17
)
69.8
75.8
77.7
80.6
(
18
)
69.8
75.8
77.7
80.6
(
19
)
69.8
75.8
78.7
80.6
(
4
)
(
20
)
71.8
79.0
81.5
85.1
(
21
)
71.8
79.0
81.5
85.1
(
22
)
71.8
79.0
81.5
85.1
(
23
)
71.8
79.0
81.5
85.2
(
24
)
71.8
79.0
81.5
85.1
(
25
)
71.8
79.0
81.5
85.1Table 6
Mean path travel time.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
70.5
71.8
72.2
72.4
(
2
)
70.5
68.5
68.6
68.7
(
3
)
70.5
68.8
68.7
68.6
(
4
)
70.5
68.2
68.5
68.8
(
5
)
70.5
68.7
68.4
68.4
(
6
)
70.5
67.7
68.5
68.7
(
7
)
70.5
68.0
68.6
68.6
(
8
)
70.5
67.5
68.4
68.8
(
2
)
(
9
)
72.5
69.9
70.0
70.0
(
10
)
72.5
70.6
71.1
71.3
(
11
)
72.5
70.9
71.1
71.2
(
12
)
72.5
70.3
70.9
71.4
(
13
)
72.5
70.8
70.8
71.0
(
3
)
(
14
)
69.8
68.0
67.2
66.8
(
15
)
69.8
68.7
68.8
68.8
(
16
)
69.8
68.2
68.6
69.0
(
17
)
69.8
68.6
68.5
68.6
(
18
)
69.8
68.0
68.7
68.8
(
19
)
69.8
67.4
68.5
69.0
(
4
)
(
20
)
71.8
69.2
68.8
68.4
(
21
)
71.8
69.8
70.1
70.2
(
22
)
71.8
70.1
69.6
69.4
(
23
)
71.8
70.9
71.2
71.4
(
24
)
71.8
70.3
71.0
71.6
(
25
)
71.8
70.7
71.0
71.2Table 7
Path travel time variance.
O-D
Path
Case  1
Case  2
Case  3
Case  4
(
1
)
(
1
)
0.0
13.5
17.6
25.5
(
2
)
0.0
24.8
29.6
37.8
(
3
)
0.0
23.6
29.5
38.0
(
4
)
0.0
25.6
30.1
37.8
(
5
)
0.0
24.0
30.4
39.3
(
6
)
0.0
27.3
30.0
41.3
(
7
)
0.0
26.2
29.8
38.1
(
8
)
0.0
28.1
33.6
37.8
(
2
)
(
9
)
0.0
30.7
37.8
50.4
(
10
)
0.0
28.5
34.3
46.0
(
11
)
0.0
27.3
34.2
46.3
(
12
)
0.0
29.2
34.8
45.8
(
13
)
0.0
27.7
35.0
47.2
(
3
)
(
14
)
0.0
26.1
35.1
46.2
(
15
)
0.0
23.5
29.7
39.3
(
16
)
0.0
25.5
30.3
38.8
(
17
)
0.0
23.9
30.6
40.2
(
18
)
0.0
26.1
30.0
39.4
(
19
)
0.0
28.0
33.9
38.9
(
4
)
(
20
)
0.0
32.8
42.6
55.7
(
21
)
0.0
30.6
38.0
49.7
(
22
)
0.0
29.8
39.8
52.5
(
23
)
0.0
27.2
34.4
46.0
(
24
)
0.0
29.1
35.0
45.2
(
25
)
0.0
27.6
35.2
46.5Table 8
Mean link flows.
Link
Case  1
Case  2
Case  3
Case  4
(
1
)
904
914
896
890
(
2
)
1,096
1,086
1,104
1,110
(
3
)
1,024
1,036
1,040
1,044
(
4
)
976
964
960
956
(
5
)
1,010
1,017
1,021
1,028
(
6
)
918
933
914
906
(
7
)
1,215
1,151
1,157
1,155
(
8
)
392
295
325
342
(
9
)
514
363
383
387
(
10
)
701
788
774
768
(
11
)
1,013
1,021
1,026
1,028
(
12
)
837
873
855
846
(
13
)
1,057
1,024
1,019
1,016
(
14
)
1,229
1,167
1,181
1,188
(
15
)
987
979
974
972
(
16
)
943
976
981
984
(
17
)
597
428
461
469
(
18
)
499
658
643
641
(
19
)
1,057
1,024
1,019
1,016For O-D pair 1, the flows of paths 4, 5, and 8 in cases 2–4 are smaller than those in case 1 whereas the flows of path 1 in cases 2–4 are larger than that in case 1. These differences can be explained as follows. The travel time variances of path 1 in cases 2–4, which are denoted by bold figures in Table7, are much smaller than those of paths 2–8, although the mean travel time of path 1 is longer than those of paths 2–8, which are denoted by bold figures in Table 6. However, path 1 has longer mean travel time than paths 2–8, and that path is more reliable in terms of travel time variance than paths 2–8 in cases 2–4. In total, the path choice probabilities of path 1 in cases 2–4 are larger than that in case  1. In contrast, since the drivers in case  1 choose their paths based only on mean travel times, the flow of path 1 is larger than those in cases 2–4. This path choice switch can be observed in the other O-D pairs (e.g., from path 10 to path 9 for O-D pair 2, from paths 17 and 19 to paths 16 and 18 for O-D pair 3, and from paths 20 and 24 to path 25 for O-D pair 4.We can find from Table6 a tendency of the mean path travel time in case  1 to be greater than those in cases 2–4. Surprisingly, this tendency holds for all paths in the network except for path 1. Obviously, this tendency was derived from the introduction of travel time variance to the drivers’ path choice behavior. We will then check how total mean travel time in the network is shortened by the introduction of travel time variance. An index for the total mean travel time for cases n∈1,…,4, TTTn, can be given by(40)TTTn=∑a∈At^ava·va.By using both the mean link flows shown in Table 8 and the mean link travel time shown in Table 9, TTTn∀n∈1,…,4 are calculated as 2.847×105, 2.789×105, 2.797×105, and 2.794×105, respectively. An introduction of travel time variance to the path choice behavior model may bring about an efficient use of the road network in terms of the mean travel time. This effect is similar to the one obtained by applying the system optimal principle (i.e., Wardrop’s second principle). From the mean link flows shown in Table 8, it is observed that the mean flows of links 5, 9, 11, 12, 16, and 18 in cases 2–4 are larger than those in case  1, whereas those of links 4, 7, 8, 13, 14, 15, and 17 in cases 2–4 are smaller than those in case  1. These changes happened by the path flow changes in cases 1–4 which we have discussed.Table 9
Mean link travel time.
Link
Case  1
Case  2
Case  3
Case  4
(
1
)
12.3
12.4
12.2
12.1
(
2
)
16.0
15.7
16.2
16.4
(
3
)
14.3
14.5
14.6
14.7
(
4
)
26.7
26.3
26.2
26.1
(
5
)
14.0
14.1
14.2
14.4
(
6
)
12.5
12.7
12.4
12.3
(
7
)
20.0
17.7
17.9
17.8
(
8
)
10.0
10.0
10.0
10.0
(
9
)
10.1
10.0
10.0
10.0
(
10
)
10.6
11.2
11.1
11.0
(
11
)
14.1
14.2
14.3
14.4
(
12
)
11.6
11.9
11.7
11.6
(
13
)
30.0
28.6
28.4
28.2
(
14
)
20.7
18.2
18.7
19.0
(
15
)
13.6
13.4
13.3
13.3
(
16
)
12.8
13.4
13.4
13.5
(
17
)
10.3
10.1
10.1
10.1
(
18
)
40.5
41.9
41.7
41.6
(
19
)
15.0
14.3
14.2
14.1As discussed in the previous section, if we do not consider the effect of travel time reliability on the driver’s path choice behavior in the network, unrealistic results may be obtained. However, the introduction of all travel time covariance between two different links in the network to the calculation of the path travel time variance is difficult to implement. Therefore, we proposed SNM, in which all travel time covariance between two adjacent links in the network is considered in calculating the path travel time variance. Our concern is now how far the results obtained in cases 1–3 are from the results obtained in case  4. The results obtained in case  4 can be regarded as the exact solution, since it is obtained by adopting the path travel time variance denoted by (28). Table 10 shows the coefficients of correlation of mean link flows among four cases. The bold figures in the table show the coefficients of correlation between case  4 and the other three cases. One can see that SNM (case  3) reproduces almost the same mean link flows as case  4, since the coefficient of correlation between case  4 and case  3 is 1 whereas the other coefficients of correlation are less than 1. Note that the coefficient of correlation between case  4 and case  1 is the smallest. Almost the same results were obtained by calculating the coefficients of correlation of mean link travel times. These results may bring about two practical implications that all travel time covariance between two different links in the network may not be required in calculating mean link flows. Instead, all travel time covariance between two adjacent links in the network is required in calculating mean link flows, and that calculation of all travel time covariance between two adjacent links in the network is easy even in a large network.Table 10
Coefficients of correlation of mean link flows.
Case  1
Case  2
Case  3
Case  4
Case  1
1.000
Case  2
0.957
1.000
Case  3
0.973
0.995
1.000
Case  4
0.969
0.997
1.000
1.000


## 6. Conclusions

In this study, we proposed a simplified network model, that is, SNM, for travel time reliability analysis. The uncertainty addressed in this model is that of O-D flows. In this model, the generalized path travel time is a linear combination of mean path travel time and path travel time variance. In calculating the path travel time variance, we consider all travel time covariance between two adjacent links in the network in SNM. A risk-averse driver in the network is assumed. By applying a network representation used for addressing intersection delays, SNM can be solved by applying a standard link-based algorithm. The other property of SNM which needs to be emphasized here is that its formulation requires only mean network flows. This property may be important for practitioners, since once the coefficient of variation of total O-D flow is determined, one can apply SNM to real road network analysis for which network data sets for a conventional network model (e.g., a deterministic/stochastic user equilibrium traffic assignment model) are already prepared.Numerical experiments are carried out for illustrating the applications and validity of SNM. The experiments assumed four types of drivers in the network. The first type of driver is a risk-neutral driver who chooses a path based only on mean path travel time. The other three types of drivers are risk-averse drivers who choose their paths based on both mean path travel time and path travel time variance. The second type of driver’s path travel time variance is calculated by assuming statistically independent link travel time. The third type of driver’s path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. The fourth type of driver’s path travel time variances is calculated by considering all travel time covariance between two different links in the network. The path travel time variance of the fourth type of driver is the exact one in the network. It is shown that mean network flows obtained by assuming the risk-neutral driver differ as a whole from those obtained by assuming the risk-averse drivers. These differences in mean network flows are generated by the effects of travel time reliability on path choice behavior by the driver. It is also shown that mean link flows obtained by assuming the third type of driver, that is, mean link flows calculated by SNM, are almost the same as the mean link flows calculated by assuming the fourth type of driver. In a practical sense, it may be difficult to calculate network flows in a large road network by assuming the fourth type of driver. In contrast, SNM can be easily applied to a large road network in calculating network flows.In this study, we recognize that the introduction of path travel time variance considering all travel time covariance between two links in a road network to the generalized path travel time is more important in expressing the driver’s route choice behavior than the introduction of the skewness of link travel time to the generalized path travel time. Therefore, SNM introduces the path travel time variance considering all travel time covariance between two adjacent links in the network to the generalized path travel time. It is interesting to see how the path choice probabilities which are calculated by assuming both the statistically independent link travel time and the skewness of link travel time differ from the probabilities calculated by SNM. In light of this, there is a need for a network equilibrium model that introduces a driver’s path choice preference based on (2). A deterministic path choice model based on Wardrop’s first principle is employed in this study in order to express the driver’s path choice behavior in the network. The introduction of stochastic models, for example, logit-based models or probit-based models, to SNM is needed, in order to express the driver’s perception error on the generalized travel time. These two challenges are our future tasks.



---

*Source: 4941535-2017-11-26.xml*