zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Generalized traffic equilibrium with probabilistic travel times and perceptions. (English) Zbl 0626.90026
The paper studies the problem of predicting traffic equilibrium (TE) in a transportation network within the framework of decision making among discrete choices in a probabilistic and uncertain environment. Conventional approaches to predict TE typically assume that travel times are deterministic and perceived accurately by the travelers; and some new TE models have considered probabilistic travel times or inaccurate perceptions but not both. In our generalized model, which we refer to as GTESP, the travel time on each route is random and each traveler perceives, possibly inaccurately, a travel time probability distribution for each route which may vary from traveler to traveler. Each traveler uses a disutility function of travel time to evaluate each route and chooses that route which minimizes his expected disutility. GTESP is difficult to solve for general nonlinear disutility functions. However, special cases - in particular when arc travel times are statistically independent and the disutility functions to evaluate route travel times are linear, exponential, or quadratic - are solvable, at least approximately, GTESP is general in the sense that most existing TE models can be shown to be special or limiting cases of GTESP. Furthermore, this paper demonstrates, with illustrative examples, that GTESP appears to capture travelers’ risk-taking behavior more realistically than existing TE models.

MSC:
90B15Network models, stochastic (optimization)
90B20Traffic problems
WorldCat.org
Full Text: DOI