Research Article  Open Access
M. Meng, C. F. Shao, Y. D. Wong, J. Zhang, "Multimodal Network Equilibrium with Stochastic Travel Times", Mathematical Problems in Engineering, vol. 2014, Article ID 136872, 8 pages, 2014. https://doi.org/10.1155/2014/136872
Multimodal Network Equilibrium with Stochastic Travel Times
Abstract
The private car, unlike public traffic modes (e.g., subway, trolley) running along dedicated trackways, is invariably subject to various uncertainties resulting in travel time variation. A multimodal network equilibrium model is formulated that explicitly considers stochastic link capacity variability in the road network. The travel time of combinedmode trips is accumulated based on the concept of the mean excess travel time (METT) which is a summation of estimated buffer time and tardy time. The problem is characterized by an equivalent VI (variational inequality) formulation where the mode choice is expressed in a hierarchical logit structure. Specifically, the supernetwork theory and expansion technique are used herein to represent the multimodal transportation network, which completely represents the combinedmode trips as constituting multiple modes within a trip. The method of successive weighted average is adopted for problem solutions. The model and solution method are further applied to study the trip distribution and METT variations caused by the different levels of the road conditions. Results of numerical examples show that travelers prefer to choose the combined travel mode as road capacity decreases. Travelers with different attitudes towards risk are shown to exhibit significant differences when making travel choice decisions.
1. Introduction
Modeling of multimodal travel behavior has attracted a growing amount of research interests as the combinedmode trip becomes common place in metropolis. In contrast to singlemode models, multimode models not only aim to integrate singlemode trips, but also take account of feasible alternative modes within a trip using two or more modes (e.g., park and ride (P&R) trips). Yet not all the combinations are possible in the real network; for example, few travelers would transfer from the private car to bus and then switch back to private car, because the private car is already part of the previous segment.
Many existing multimodal traffic assignment models are formulated with equilibrium constraints. The core issue is to deal with the interaction between mode choice and route choice [1]. The former one is commonly modeled with hierarchical logit structure, which assigns the trips on each reasonable travel mode on the basis of the minimum perceived travel cost. The latter one follows two basic kinds of assumptions including deterministic assumption and stochastic assumption. The deterministic assumption considers that all travelers know the perfect information and choose the best route with the minimum travel cost. Stochastic models deem that traveler’s perception is affected by some random errors, and they choose their perceived best routes according to some probabilities. Meanwhile, the generalized travel cost essentially consists of driving cost and transfer cost as the consideration of transfer behavior.
At present, multimodal network equilibrium in normal traffic conditions has been much researched; mathematical programming formulation, variational inequality theory, and fixedpoint method have been developed and successfully applied in modeling real networks [2, 3]. Zhou et al. [4] presented two different equations to formulate the combined travel tips problem which incorporated traditional fourstep model. Xu and Gao’s [5] grouped all travelers in different classes with various travel behavior, like the mode/route selection and transfer points. They formulated this equilibrium model as a fixedpoint equation and also analyzed its existence and uniqueness. Khani et al. [6] divided multiple traffic modes into the two major categories of private and public modes, with transfer constraints. For solving the equilibrium model, they proposed an intermodal path algorithm according to generalized travel cost, including privateside travel cost, publicside travel cost, and transfer cost. Reviews of these models are reported in Lo et al. [7], García and Marín [8], and Li et al. [9].
Much research has been made in recent decade in the formulation, analysis, and computation of stochastic travel time. Given the nongeneralizable sources of uncertainties causing travel time variability [10–12], the route choice criterion under such uncertain variations is not the same as under normal traffic conditions. Uchida and Iida [13] defined the effective travel time as the sum of mean travel time plus a safety margin to model the travel uncertainty. Chan and Lam [14] introduced a concept of path preference index (PI) to quantify the attractiveness of each alternative route. Lo et al. [15] postulated that travelers would make decision based on the travel time budget (TTB), which is a summation of expected travel time and travel time margin. This TTB differs with travel risk attitude. Several studies have shown that the TTB concept is more grounded in reality than effective travel time [11, 16]. Recently, Zhou and Chen [17] and Chen and Zhou [18–20] assumed that travelers would like to choose the route with the minimal mean excess travel times (METT), where METT is the sum of buffer time and tardy time. Buffer time guarantees the travel time reliability and tardy time reflects the unreliability factor beyond the accepted range of travel time. In contrast to TTB, METT contains reliable and unreliable elements together in the travel choice procedure, which is a more conservative measure of risk. The network equilibrium with METT concept is named as mean excess traffic equilibrium (METE). Nie [21] assumed that traveler will select the routes with the minimal budget to assure the probability of on time arrival. Wu and Nie [22] developed a new solution algorithm for the stochastic route choice problem to avoid the route enumeration. Xu et al. [23] extended the METE model to the case with multiclass users, where travelers have different riskaversion attitudes. Sun and Gao [24] presumed that the travel time has a certain degree of robustness and proposed a robust meanexcess travel time (RMETT) to discuss the route travel behavior.
Network equilibrium models which simultaneously focus on the combinedmode trip and the travel time variability have not received much attention in the literature. Meng et al. [25] studied the travel behavior in a degradable multimodal transportation network. They assumed only that travelers choose the routes which have the minimum expected travel time. Häme and Hakula [26] considered the travel uncertainty in a multimodal network, where the travel decision is described as Markov decision process.
The present approach for formulating network equilibrium model with stochastic travel time can be taken as the development of the model of Chen and Zhou [19] to multimodal network with combined modes. The subway network with overlapping private car network is based on the supernetwork structure. The subway network running in the specific environment is unaffected by traffic uncertainties, while the private car may suffer from various exogenous sources of uncertainties which may cause road capacity variations. The travel time variability is expressed by METT. The user equilibrium is applied under the uncertainty assumption, and the mode choice is modeled with a logit formulation. The equivalent variational inequality model is proposed with a routebased solution algorithm.
The following sections are organized as follows: METT is introduced in Section 2. Section 3 proposes the multimodal traffic network equilibrium model. A heuristic solution algorithm is given in Section 4. Section 5 shows the numerical examples to explain the application. Conclusions and discussions are drawn in Section 6.
2. Multimodal Network
2.1. Notation
: a multimodal transportation network, : set of nodes, : set of links, is one of the links , : set of road link, subway link, and the transfer link, , : set of OD (origin and destination) pairs,is one of the OD pairs , : traffic demand of OD pair , : set of routes of OD pair , is one of the routes , : flow on route , : flow on link , : routelink incidence variable, where if route uses link and 0 otherwise.
2.2. Supernetwork
The supernetwork concept has been used extensively to describe the multimodal transportation network since it was first proposed by Sheffi in 1985 [27–29]. Figure 1 shows an example of a small multimodal transportation network, which has 9 nodes and 11 links. The transfer links and effectively connect the two different traffic modal layers. The route 1011 is part of a subway line, which corresponds with the road route 67.
(a)
(b)
3. Traffic Equilibrium Model
3.1. Route Travel Time
According to Chen and Zhou [19], the travelers cannot make correct estimation of their total travel time as travel time varies. In multimodal transportation network, however, travelers who choose the subway trip can perceive their travel time more accurately as the subway runs to a fixed schedule. Therefore, the travel time of a combinedtrip trip which involves at least two traffic modes contains the variable travel time in the uncertain portion of the network, the certain running time, and the transfer time. The general route travel time should be where is the travel time of route and is the travel time of link . The link travel time is calculated based on the BPR (Bureau of Public Roads) function [30] as where is the freeflow link travel time and is the road capacity on link and and are the nonnegative parameters in BPR function. In conventional analyses, the road capacity is regarded as a constant; under stochastic nature of the road capacity variations or degradations, the capacity of each link is subject to uncertainty and should be a random variable. Therefore, the link travel time is a random variable as well, which is a common assumption in several studies [19, 21, 31–33]. The link travel time is described by a probability distribution. According to (2), its mean and variance can be determined as
Assuming that the freeflow link travel time is a constant and the capacity degradation random variable is independent of the amount of traffic on it, and can be expressed as where the term is the probability density function (PDF) of the uniform distribution with upper bound and lower bound [15]; is the design capacity of ; and is the degradation parameter.
Upon simplification, the mean and variance of the road link travel time are expressed as
Assume that the link travel time in subway network is determined by the subway run time, while the transfer travel time includes the walking time and the waiting time; that is, where and are the walking time and waiting time on link . is influenced by the departure frequency as , where is the departure frequency of the objective subway at the transfer node and the average of the waiting time is considered for travelers with different arrival time. is influenced by distance between the parking lot and the subway platform, which can be regarded as a deterministic value based on the average walking time for a normal person.
Based on the centrallimit theorem, the mean and variance of the route travel time in the multimodal network can be calculated by
3.2. Mean Excess Travel Time
In accordance with Chen and Zhou [19], travelers search a route with consideration of two components: one is the corresponding TTB allowing for on time arrival, the other being the impacts of excessively late arrival. Upon further mathematical operations, the METT of route can be represented as where is the METT of route and is the standard normal cumulative distribution function (CDF).
3.3. Equilibrium Conditions
The multimodal traffic network equilibrium condition in the case of METT can be stated as follows: flow on route is positive if METT on is equal and minimal METT; all unused routes have an equal or higher METT, which can be expressed as where is the minimal METT under the condition of user equilibrium between the OD pair .
3.4. VI Formulation
The multimodal traffic network equilibrium conditions [34] can be expressed as a VI formulation: where ^{∗} represents the variable value at equilibrium. The feasible set is defined by the following equations where the conservation of traffic demand, traffic flow, and nonnegative constraint can be satisfied:
The VI formulation of (11) is equivalent with the multimodal traffic network equilibrium condition (10). Equation (11) is derived on the basis of (10). From (10), one gets Combining (16) with (14) leads to Adding up (10) for all the routes in all OD pairs leads to As for an OD pair , then the term . Based on (18) and , the multimodal traffic network equilibrium conditions of (11) can thus be deduced from (10).
As (11) is equivalent to (18), one can also derive (10) on the basis of (18). Let all traffic flows on the nonequilibrium routes in all the OD pairs be equal to equilibrium flow; then (17) can be simplified as when , could be positive or negative. When , then . To prove (10), must be greater than or equal to . Derivation of all the routes with the same process shows that (10) is valid. Therefore, (10) is equivalent to (11). The feasible set is close, nonempty, and convex, as it is composed of nonnegative linear formulations. Meanwhile, as the travel demand is bounded, the feasible set is compact. Together with , which is continuous, the VI formulation (11) has at least one solution based on the standard theorem.
4. Solution Algorithm
A solution procedure is developed based on MSWA (method of successive weighted average) [35]. The difference between MSWA and traditional MSA (method of successive average) is that the iteration step size of MSWA is not a fixed value but gives more weight to more recent iteration points which will speed up the convergence. Specific steps are as follows.
Step 1 (Initialization). Set the iteration and the link flow ; calculate the METT of route based on (9) with the freeflow travel time ; assign travel demand on the network to obtain the original feasible link flow based on the allornothing method.
Step 2. Update travel time and calculate and .
Step 3. Determine a descent direction. Calculate the METT of route and assign on the network to obtain the auxiliary link flow based on the allornothing method.
Step 4 (Iteration). Let ; calculate the link flow by
Step 5 (Convergence Judgment). Let the merit function be defined as If (where is the convergence criteria), then stop; otherwise, , and return to Step 2.
5. Experiments and Analysis
5.1. A Small Network
Figure 1 gives the first experiment network which includes 1 OD pair (1,6). The road network parameters are defined in Table 1, while the parameters for subway links and transfer links are , , , , , and . Five thousand units travel demand is considered, while other information is , , , and .

Figure 2 gives the convergence performance of the MSWAbased algorithm at different confidence level. As the iteration time increases, the convergence criteria gradually decrease. When the confidence level , 0.5, and 0.9, the MSWA algorithm terminates at iterations 36, 43, and 62, respectively. In contrast, the MSA algorithm needed 75, 92, and 137 times of iteration to achieve convergence under the same conditions of this experiment.
Table 2 shows the traffic assignment results under different road conditions with the three confidence levels , 0.5, and 0.9. Four cases of road network are designed including normal (0.95), mild degradation (), moderate degradation (), and severe degradation (). The flow results show that, with the degradation of the road network, the car trip decreases while the P&R trip increases at different levels. It is because degradation increases the travel time in the road network, and travelers prefer P&R trip given the punctuality of subway network.

With the degradation of the road network, the METT for different confidence level increases in varying degrees. As shown in Figure 3, the intensity of METT increases for the case which is much greater than at (2 times in the severe condition), while that for is in between. When travelers have 10% confidence level of on time arrival, they would be much less inclined (<5%) to change their METT; on the contrary, if travelers have 90% confidence level of on time arrival (almost 27%), they would be more likely to adjust their perceived METT according to the network condition.
With the degradation of the road network, the ratio of car trip decreases with three confidence level cases. As shown in Figure 4, the biggest decline is the case when as the travelers perceive the situation better than other cases. When , travelers would rather maintain their existing knowledge than explore the new information. The combinedtrip becomes more advantageous as the road network becomes more uncertain.
5.2. Sioux Fall Network
To further illustrate the performance of the algorithm, a test is performed on a modified network from the Sioux Fall Network [36] as shown in Figure 5, which has 24 nodes, 76 road links, 24 subway links, and 36 OD pairs. The bold lines are the subway lines, and hatched nodes are the origin nodes and destination nodes.
The proposed algorithm terminates after 37 iterations and the CPU (4∗2core, 2.13 GHz, RAM8Gb) time is 8.7 s. When the confidence level in the normal condition, the convergence of the algorithm by the RMSE (root mean square error) is shown in Figure 6. This figure shows that the algorithm can quickly reach the convergence precision, which is effective and exercisable.
Two routes connecting OD pair (1, 20) are also examined in both normal condition and moderate degradation condition, including a car route 13414243444546 and a P&R route 134156789. The route flow evolutions of the two routes during the iteration process are depicted in Figures 7 and 8. From these figures, one can see that in the normal condition the flow of the car route rises quickly while the growth of the P&R route flow is slow. In the moderate degradation, however, the P&R route flow maintains a strong momentum of growth, while the car route flow does not increase at a rapid pace. These results also confirm that the attraction of combined travel mode under moderate road network degradation is significantly stronger than under normal condition.
6. Conclusions
In this study, the METT model is extended into the multimodal transportation network with consideration of combined modes. In the car transportation network, the travelers cannot make a correct estimate of their total travel time as the travel time variability, while travelers who choose the subway trip can perceive their travel time more accurately as the subway runs to a fixed schedule. Based on the supernetwork theory and extension technique, the combinedmode trips are formulated as an equivalent VI equation which is solved by a MSWAbased algorithm. Experiment results showed the practicality and effectiveness of the developed model and algorithm and also revealed that, with the degradation of road network, travelers prefer to choose the combined trips to decrease their mean excess travel time. The attraction of the combined travel mode will become stronger as the degradation of the road network increases. Travelers with different attitudes towards risk varied significantly during travel decisions. Next study should be carried out to apply the proposed model to realworld networks and extend the generalized multimodal transportation systems to the public bus. Also the parameter calibration should be carefully focused in practice.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The work described in this paper is supported by three research Grants from the National Basic Research Program of China (no. 2012CB725403) and the National Natural Science Foundation of China (no. 51338008 and no. 71210001).
References
 X. D. Yan and J. W. Wu, “Effectiveness of variable message signs on driving behavior based on a driving simulation experiment,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 206805, 9 pages, 2014. View at: Publisher Site  Google Scholar
 D. X. Yu, Z. S. Yang, H. Yu, and X. R. Jiang, “Research on largescale road network partition and route search method combined with traveler preferences,” Mathematical Problems in Engineering, vol. 2013, Article ID 950876, 8 pages, 2013. View at: Publisher Site  Google Scholar
 C. J. Zhu, B. Jia, L. H. Han, and Z. Y. Gao, “Parking pricing and model split under uncertainty,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 679719, 8 pages, 2014. View at: Publisher Site  Google Scholar
 Z. Zhou, A. Chen, and S. C. Wong, “Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model,” European Journal of Operational Research, vol. 198, no. 1, pp. 129–138, 2009. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 M. Xu and Z. Gao, “Multiclass multimodal network equilibrium with regular choice behaviors: a general fixed point approach,” in Transportation and Traffic Theory 2009: Golden Jubilee, pp. 301–325, Springer US, New York, NY, USA, 2009. View at: Publisher Site  Google Scholar
 A. Khani, S. Lee, M. Hickman, H. Noh, and N. Nassir, “Intermodal path algorithm for timedependent auto network and scheduled transit service,” Transportation Research Record, vol. 2284, no. 1, pp. 40–46, 2012. View at: Publisher Site  Google Scholar
 H. K. Lo, C. W. Yip, and K. H. Wan, “Modeling transfer and nonlinear fare structure in multimodal network,” Transportation Research B: Methodological, vol. 37, no. 2, pp. 149–170, 2003. View at: Google Scholar
 R. García and A. Marín, “Network equilibrium with combined modes: models and solution algorithms,” Transportation Research B: Methodological, vol. 39, no. 3, pp. 223–254, 2005. View at: Publisher Site  Google Scholar
 Z. Li, W. H. K. Lam, and S. C. Wong, “Modeling intermodal equilibrium for bimodal transportation system design problems in a linear monocentric city,” Transportation Research B Methodological, vol. 46, no. 1, pp. 30–49, 2012. View at: Publisher Site  Google Scholar
 D. Watling, “User equilibrium traffic network assignment with stochastic travel times and late arrival penalty,” European Journal of Operational Research, vol. 175, no. 3, pp. 1539–1556, 2006. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 B. W. Y. Siu and H. K. Lo, “Doubly uncertain transportation network: degradable capacity and stochastic demand,” European Journal of Operational Research, vol. 191, no. 1, pp. 166–181, 2008. View at: Publisher Site  Google Scholar
 E. BenElia and Y. Shiftan, “Which road do I take? A learningbased model of routechoice behavior with realtime information,” Transportation Research A: Policy and Practice, vol. 44, no. 4, pp. 249–264, 2010. View at: Publisher Site  Google Scholar
 T. Uchida and Y. Iida, “Risk assignment: a new traffic assignment model considering the risk travel time variation,” in Proceedings of the 12th International Symposium on Transportation and Traffic Theory, pp. 89–105, Berkeley, Calif, USA, 1993. View at: Google Scholar
 K. S. Chan and W. H. Lam, “Impact of road pricing on the network reliability,” Journal of the Eastern Asia Society for Transportation Studies, vol. 6, pp. 2060–2075, 2005. View at: Google Scholar
 H. K. Lo, X. W. Luo, and B. W. Y. Siu, “Degradable transport network: travel time budget of travelers with heterogeneous risk aversion,” Transportation Research Part B: Methodological, vol. 40, no. 9, pp. 792–806, 2006. View at: Publisher Site  Google Scholar
 H. Shao, W. H. K. Lam, and M. L. Tam, “A reliabilitybased stochastic traffic assignment model for network with multiple user classes under uncertainty in demand,” Networks and Spatial Economics, vol. 6, no. 34, pp. 173–204, 2006. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Z. Zhou and A. Chen, “Comparative analysis of three user equilibrium models under stochastic demand,” Journal of Advanced Transportation, vol. 42, no. 3, pp. 239–263, 2008. View at: Publisher Site  Google Scholar
 A. Chen and Z. Zhou, “A stochastic areliable meanexcess traffic equilibrium model with probabilistic travel times and perception errors,” in Proceedings of the 18th International Symposium on Transportation and Traffic Theory: Golden Jubilee, pp. 117–145, Springer, Berlin, Germany, 2009. View at: Google Scholar
 A. Chen and Z. Zhou, “The αreliable meanexcess traffic equilibrium model with stochastic travel times,” Transportation Research Part B: Methodological, vol. 44, no. 4, pp. 493–513, 2010. View at: Publisher Site  Google Scholar
 A. Chen, Z. Zhou, and W. H. K. Lam, “Modeling stochastic perception error in the meanexcess traffic equilibrium model,” Transportation Research B: Methodological, vol. 45, no. 10, pp. 1619–1640, 2011. View at: Publisher Site  Google Scholar
 Y. M. Nie, “Multiclass percentile user equilibrium with flowdependent stochasticity,” Transportation Research B: Methodological, vol. 45, no. 10, pp. 1641–1659, 2011. View at: Publisher Site  Google Scholar
 X. Wu and Y. M. Nie, “Modeling heterogeneous risktaking behavior in route choice: a stochastic dominance approach,” ProcediaSocial and Behavioral Sciences, vol. 17, pp. 382–404, 2011. View at: Google Scholar
 X. Xu, A. Chen, Z. Zhou, and L. Cheng, “A multiclass meanexcess traffic equilibrium model with elastic demand,” Journal of Advanced Transportation, vol. 48, no. 3, pp. 203–222, 2014. View at: Publisher Site  Google Scholar
 H. Sun and Z. Gao, “Stochastic traffic equilibrium based on travel time robust reliability,” Journal of Transportation Systems Engineering and Information Technology, vol. 12, no. 2, pp. 76–84, 2012. View at: Google Scholar
 M. Meng, C. Shao, J. Zeng, C. Zhuge, and C. Dong, “Stochastic user equilibrium with combined mode in a degradable multimodal transportation network,” Journal of Computers, vol. 7, no. 12, pp. 3005–3012, 2012. View at: Publisher Site  Google Scholar
 L. Häme and H. Hakula, “Dynamic journeying under uncertainty,” European Journal of Operational Research, vol. 225, no. 3, pp. 455–471, 2013. View at: Publisher Site  Google Scholar
 A. Nagurney, “On the relationship between supply chain and transportation network equilibria: a supernetwork equivalence with computations,” Transportation Research E: Logistics and Transportation Review, vol. 42, no. 4, pp. 293–316, 2006. View at: Publisher Site  Google Scholar
 H. Chen, H. Chou, and Y. Chiu, “On the modeling and solution algorithm for the reverse logistics recycling flow equilibrium problem,” Transportation Research C: Emerging Technologies, vol. 15, no. 4, pp. 218–234, 2007. View at: Publisher Site  Google Scholar
 G. Ramadurai and S. Ukkusuri, “Dynamic user equilibrium model for combined activitytravel choices using activitytravel supernetwork representation,” Networks and Spatial Economics, vol. 10, no. 2, pp. 273–292, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Bureau of Public Roads, Traffic Assignment Manual, Bureau of Public Roads, Washington, DC, USA, 1964.
 H. K. Lo and Y. K. Tung, “Network with degradable links: capacity analysis and design,” Transportation Research B: Methodological, vol. 37, no. 4, pp. 345–363, 2003. View at: Publisher Site  Google Scholar
 W. H. K. Lam, H. Shao, and A. Sumalee, “Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply,” Transportation Research Part B: Methodological, vol. 42, no. 10, pp. 890–910, 2008. View at: Publisher Site  Google Scholar
 A. Sumalee, K. Uchida, and W. H. K. Lam, “Stochastic multimodal transport network under demand uncertainties and adverse weather condition,” Transportation Research C: Emerging Technologies, vol. 19, no. 2, pp. 338–350, 2011. View at: Publisher Site  Google Scholar
 F. Giannessi and A. Maugeri, Variational Inequalities and Network Equilibrium Problems, Plenum Press, New York, NY, USA, 1995.
 H. X. Liu, X. He, and B. He, “Method of successive weighted averages (MSWA) and selfregulated averaging schemes for solving stochastic user equilibrium problem,” Networks and Spatial Economics, vol. 9, no. 4, pp. 485–503, 2009. View at: Google Scholar
 L. J. Leblanc, “An algorithm for the discrete network design problem,” Transportation Science, vol. 9, no. 3, pp. 183–199, 1975. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 M. Meng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.