The Experts below are selected from a list of 71676 Experts worldwide ranked by ideXlab platform
Haijun Huang - One of the best experts on this subject based on the ideXlab platform.
-
a discrete dynamical system of formulating traffic assignment revisiting smith s model
Transportation Research Part C-emerging Technologies, 2016Co-Authors: Renyong Guo, Haijun HuangAbstract:Abstract Through relaxing the Behavior Assumption adopted in Smith’s model (Smith, 1984), we propose a discrete dynamical system to formulate the day-to-day evolution process of traffic flows from a non-equilibrium state to an equilibrium state. Depending on certain preconditions, the equilibrium state can be equivalent to a Wardrop user equilibrium (UE), Logit-based stochastic user equilibrium (SUE), or boundedly rational user equilibrium (BRUE). These equivalence properties indicate that, to make day-to-day flows evolve to equilibrium flows, it is not necessary for travelers to choose their routes based on actual travel costs of the previous day. Day-to-day flows can still evolve to equilibrium flows provided that travelers choose their routes based on estimated travel costs which satisfy these preconditions. We also show that, under a more general Assumption than the monotonicity of route cost function, the trajectory of the dynamical system converges to a set of equilibrium flows by reasonably setting these parameters in the dynamical system. Finally, numerical examples are presented to demonstrate the application and properties of the dynamical system. The study is helpful for understanding various processes of forming traffic jam and designing an algorithm for calculating equilibrium flows.
Renyong Guo - One of the best experts on this subject based on the ideXlab platform.
-
a discrete dynamical system of formulating traffic assignment revisiting smith s model
Transportation Research Part C-emerging Technologies, 2016Co-Authors: Renyong Guo, Haijun HuangAbstract:Abstract Through relaxing the Behavior Assumption adopted in Smith’s model (Smith, 1984), we propose a discrete dynamical system to formulate the day-to-day evolution process of traffic flows from a non-equilibrium state to an equilibrium state. Depending on certain preconditions, the equilibrium state can be equivalent to a Wardrop user equilibrium (UE), Logit-based stochastic user equilibrium (SUE), or boundedly rational user equilibrium (BRUE). These equivalence properties indicate that, to make day-to-day flows evolve to equilibrium flows, it is not necessary for travelers to choose their routes based on actual travel costs of the previous day. Day-to-day flows can still evolve to equilibrium flows provided that travelers choose their routes based on estimated travel costs which satisfy these preconditions. We also show that, under a more general Assumption than the monotonicity of route cost function, the trajectory of the dynamical system converges to a set of equilibrium flows by reasonably setting these parameters in the dynamical system. Finally, numerical examples are presented to demonstrate the application and properties of the dynamical system. The study is helpful for understanding various processes of forming traffic jam and designing an algorithm for calculating equilibrium flows.
Xuegang Ban - One of the best experts on this subject based on the ideXlab platform.
-
boundedly rational user equilibria brue mathematical formulation and solution sets
Transportation Research Part B-methodological, 2013Co-Authors: Henry X Liu, Jongshi Pang, Xuegang BanAbstract:Abstract Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational Behavior Assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands connecting multiple OD pairs. According to the definition of the ɛ-BRUE, where ɛ is the indifference band for the perceived travel cost, we formulate the ɛ-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE-NCP formulation. To obtain the whole BRUE solution set encompassing all BRUE flow patterns, we firstly propose a methodology of generating various path combinations which may be utilized under the boundedly rational Behavior Assumption. We find out that with the increase of the indifference band, the path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference bands to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. After these utilized path sets are attained, the BRUE solution set can be obtained when we assign all traffic demands to these utilized paths. Various numerical examples are given to illustrate our findings.
Henry X Liu - One of the best experts on this subject based on the ideXlab platform.
-
boundedly rational user equilibria brue mathematical formulation and solution sets
Transportation Research Part B-methodological, 2013Co-Authors: Henry X Liu, Jongshi Pang, Xuegang BanAbstract:Abstract Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational Behavior Assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands connecting multiple OD pairs. According to the definition of the ɛ-BRUE, where ɛ is the indifference band for the perceived travel cost, we formulate the ɛ-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE-NCP formulation. To obtain the whole BRUE solution set encompassing all BRUE flow patterns, we firstly propose a methodology of generating various path combinations which may be utilized under the boundedly rational Behavior Assumption. We find out that with the increase of the indifference band, the path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference bands to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. After these utilized path sets are attained, the BRUE solution set can be obtained when we assign all traffic demands to these utilized paths. Various numerical examples are given to illustrate our findings.
Jongshi Pang - One of the best experts on this subject based on the ideXlab platform.
-
boundedly rational user equilibria brue mathematical formulation and solution sets
Transportation Research Part B-methodological, 2013Co-Authors: Henry X Liu, Jongshi Pang, Xuegang BanAbstract:Abstract Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational Behavior Assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands connecting multiple OD pairs. According to the definition of the ɛ-BRUE, where ɛ is the indifference band for the perceived travel cost, we formulate the ɛ-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE-NCP formulation. To obtain the whole BRUE solution set encompassing all BRUE flow patterns, we firstly propose a methodology of generating various path combinations which may be utilized under the boundedly rational Behavior Assumption. We find out that with the increase of the indifference band, the path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference bands to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. After these utilized path sets are attained, the BRUE solution set can be obtained when we assign all traffic demands to these utilized paths. Various numerical examples are given to illustrate our findings.