Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters

Konishi, Hideo
August 2004
Transportation Science;Aug2004, Vol. 38 Issue 3, p315
Academic Journal
This paper discusses the uniqueness of user equilibrium in transportation networks with heterogeneous commuters. Daganzo (1983) proved the uniqueness of (stochastic) user equilibrium when commuters have heterogeneous tastes over possible paths, but identical disutility functions from time costs. We first show, by example, that his result may not apply in general networks if disutility functions are allowed to differ. However, for "simple" transportation networks, we show that user equilibrium is always unique and weakly Pareto efficient (cf. the Braess example) for a general class of utility functions. We investigate whether this result applies to more general networks. We also show that user equilibrium is unique in a dynamic bottleneck model with a simple network. We discuss an interesting relationship between the following two problems: the existence of user equilibrium in a finite model and the uniqueness of user equilibrium in a continuum model. In the appendix, we also provide a proof of a slightly generalized version of Daganzo's theorem.


Related Articles

  • Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes. Lindsey, Robin // Transportation Science;Aug2004, Vol. 38 Issue 3, p293 

    Under relatively general assumptions a unique deterministic departure-time user equilibrium with a finite departure rate exists in the bottleneck model with drivers who differ in their unit costs of travel time, preferred times of arrival, and schedule delay cost functions. Existence requires...

  • A New Tradable Credit Scheme for the Morning Commute Problem. Nie, Yu // Networks & Spatial Economics;Sep2015, Vol. 15 Issue 3, p719 

    This paper seeks to apply a new tradable credit scheme in the morning commute problem. When implementing such a scheme, the congestion management authority first delineates a peak-time window and then requires all traveler who pass the bottleneck within that window to either pay certain units of...

  • Stochastic Equilibrium Model of Peak Period Traffic Congestion. de Palma, Andr&dacute;; Ben-Akiva, Moshe; Lefèvre, Claude; Litinas, Nicolaos // Transportation Science;Nov83, Vol. 17 Issue 4, p430 

    This paper addresses the problem of peak period traffic congestion. It considers the queues and delays at a single point of insufficient capacity. A model is developed to predict the pattern of traffic volumes and travel times during a peak period. It consists of two basic elements: a...

  • Travel Time Valuation through Hedonic Regression. Edmonds Jr., Radcliffe G. // Southern Economic Journal;Jul83, Vol. 50 Issue 1, p83 

    The objective of this paper is to present a different and more thorough approach to an analysis of the valuation of travel time. Rather than merely providing a single estimate, use of an hedonic price function and marginal valuation functions allows analysis of how time savings benefits vary...

  • Six-laning of Delhi-Jaipur stretch hits roadblock.  // Commercial Vehicle;Aug2013, Vol. 7 Issue 11, p27 

    The article reports on issue linked to six-laning of the arterial Delhi-Jaipur stretch along the NH8 highway in India leading to the increase of travel time by up to two hours for commuters even as they pay extra toll.

  • The Morning Commute for Nonidentical Travelers. Newell, Gordon F. // Transportation Science;May87, Vol. 21 Issue 2, p74 

    In previous theories of the morning rush hour, travelers with different work starting times are assumed to attach certain values to queueing delay and schedule delay (deviations from their work starting times), the same values for all travelers. The goal was to establish and evaluate a stable...

  • Alternative Conditions for a Well-Behaved Travel Time Model. Carey, Malachy; Ge, Y. E. // Transportation Science;Aug2005, Vol. 39 Issue 3, p417 

    The travel time Τ(t) on a link has often been treated in dynamic traffic assignment (DTA) as a function of the number of vehicles x(t) on the link, that is, Τ(t) =f(x(t)). In earlier papers, bounds on the gradient of this travel time function f(x) have been introduced to ensure that the...

  • A Robust Solution Approach to the Dynamic Vehicle Scheduling Problem. Huisman, Dennis; Freling, Richard; Wagelmans, Albert P. M. // Transportation Science;Nov2004, Vol. 38 Issue 4, p447 

    This paper presents a solution approach to the dynamic vehicle scheduling problem. This approach consists of solving a sequence of optimization problems, where we take into account different scenarios for future travel times. We discuss the potential benefit of our approach compared to the...

  • RTA marks a start to transportation plan. Moore, Philip S. // Inside Tucson Business;8/14/2006, Vol. 16 Issue 9, p21 

    The article reports on the celebration the implementation of the 20-year regional transportation plan approved by the Regional Transportation Authority in Tucson, Arizona. The plan started with six routes with additional busses to be used at peak travel times. Key routes will be expanded to...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics