scispace - formally typeset
Search or ask a question
Author

Jinye Zhao

Bio: Jinye Zhao is an academic researcher from ISO New England. The author has contributed to research in topics: Nonlinear complementarity problem & Bottleneck. The author has an hindex of 1, co-authored 1 publications receiving 80 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: The authors formulates the dynamic equilibrium conditions for a single bottleneck model with heterogeneous commuters as a linear complementarity problem and presents theoretical proofs for solution existence and uniqueness, and numerical results and insights for different heterogeneity assumptions.
Abstract: This paper formulates the dynamic equilibrium conditions for a single bottleneck model with heterogeneous commuters as a linear complementarity problem. This novel formulation offers a formal framework for the rigorous study and solution of a single bottleneck model with general heterogeneity parameter assumptions, enabling the adoption of well established complementarity theory and methods to analyze the model, and providing a significant contribution to the existing literature that either lacks a rigorous formulation or solves the problem under a limited set of heterogeneity parameter assumptions. The paper presents theoretical proofs for solution existence and uniqueness, and numerical results and insights for different heterogeneity assumptions.

87 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors demonstrate the efficiency and effectiveness of a tradable credit system in managing the morning commute congestion with identical and non-identical commuters, and prove that an optimal credit charging scheme always exists despite how commuters vary in their value-of-time (VOT).
Abstract: We demonstrate the efficiency and effectiveness of a tradable credit system in managing the morning commute congestion with identical and nonidentical commuters. The credit system consists of a time-varying credit charged at the bottleneck and an initial credit distribution to the commuters, where the credits are universal in terms of time. Credits are tradable between the commuters and the credit price is determined by a competitive market. Under the assumption that late-arrival is not allowed, we prove that an optimal credit charging scheme, which completely eliminates the bottleneck queue, always exists despite how commuters vary in their value-of-time (VOT). The optimal charge rate is strictly increasing and convex with time, which therefore drives the commuters to depart in the increasing order of their VOT. The optimal credit charging scheme is pareto-improving, but may cause undesirable welfare distribution among the commuters. Our study shows that a combination of an initial credit distribution and an optimal credit charging scheme can simultaneously achieve system optimum and certain forms of equality (e.g., “numerical” or “proportional” equality), and that the commuters in the middle VOT bracket will receive the most credits under the proportionally equitable credit distribution.

130 citations

Journal ArticleDOI
TL;DR: A bibliometric analysis approach is adopted for identifying the distribution of all journal publications, influential papers, top contributing authors, and leading topics in the past half century of bottleneck model research since its inception.
Abstract: The bottleneck model introduced by Vickrey in 1969 has been recognized as a benchmark representation of the peak-period traffic congestion due to its ability to capture the essence of congestion dynamics in a simple and tractable way. This paper aims to provide a 50th anniversary review of the bottleneck model research since its inception. A bibliometric analysis approach is adopted for identifying the distribution of all journal publications, influential papers, top contributing authors, and leading topics in the past half century. The literature is classified according to recurring themes into travel behavior analysis, demand-side strategies, supply-side strategies, and joint strategies of demand and supply sides. For each theme, typical extended models developed to date are surveyed. Some potential directions for further studies are discussed.

96 citations

Journal ArticleDOI
TL;DR: In this paper, the authors developed a formulation for the network level dynamic traffic equilibrium model with departure time choice and route choice, where the embedded network loading procedure follows the cell transmission model without the holding-back issues by using detailed representations of flows at merges and diverges.
Abstract: This paper develops a formulation for the network level dynamic traffic equilibrium model with departure time choice and route choice. The embedded network loading procedure follows the cell transmission model without the holding-back issues by using detailed representations of flows at merges and diverges. The problem is modeled using a complementarity approach. The existence of the equilibrium solution is discussed using techniques from generalized variational inequalities. Computational results are performed using state of the art solvers. Since these solvers fail to solve any reasonable size networks, a specialized projection algorithm is developed to solve the problem. Numerical results are presented to demonstrate the performance of the algorithm in various starting with simple networks and extending to reasonable size networks with different traffic parameters. It is shown that the solution procedure produces good dynamic equilibrium solutions for general transportation networks.

93 citations

Journal ArticleDOI
TL;DR: A bottleneck model in which the capacity of the bottleneck is assumed stochastic and follows a uniform distribution is investigated, and the analytical and numerical results show that the capacity variability would indeed change the commuters' travel behavior by increasing the mean trip cost and lengthening the peak period.
Abstract: In this paper we investigate a bottleneck model in which the capacity of the bottleneck is assumed stochastic and follows a uniform distribution. The commuters' departure time choice is assumed to follow the user equilibrium principle according to mean trip cost. The analytical solution of the proposed model is derived. Both the analytical and numerical results show that the capacity variability would indeed change the commuters' travel behavior by increasing the mean trip cost and lengthening the peak period. We then design congestion pricing schemes within the framework of the new stochastic bottleneck model, for both a time-varying toll and a single-step coarse toll, and prove that the proposed piecewise time-varying toll can effectively cut down, and even eliminate, the queues behind the bottleneck. We also find that the single-step coarse toll could either advance or postpone the earliest departure time. Furthermore, the numerical results show that the proposed pricing schemes can indeed improve the efficiency of the stochastic bottleneck through decreasing the system's total travel cost.

92 citations

Journal ArticleDOI
TL;DR: This paper formulate the dynamic user equilibrium problem with an embedded cell transmission model on a network with a single OD pair, multiple parallel paths, multiple user classes with elastic demand, based on ideas from complementarity theory.
Abstract: In this paper we formulate the dynamic user equilibrium problem with an embedded cell transmission model on a network with a single OD pair, multiple parallel paths, multiple user classes with elastic demand. The formulation is based on ideas from complementarity theory. The travel time is estimated based on two methods which have different transportation applications: (1) maximum travel time and (2) average travel time. These travel time functions result in linear and non-linear complementarity formulations respectively. Solution existence and the properties of the formulations are rigorously analyzed. Extensive computational experiments are conducted to demonstrate the benefits of the proposed formulations on various test networks.

78 citations