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)
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. (English) Zbl 0997.90038
Summary: In congested transportation and data networks, travel (or transmission) times are time-varying quantities that are at best known a priori with uncertainty. In such Stochastic, Time-Varying (STV) networks, one can choose to use the a priori Least-Expected Time (LET) path or one can make improved routing decisions en route as traversal times on traveled arcs are experienced and arrival times at intermediate locations are revealed. In this context, for a given origin-destination pair at a specific departure time, a single path may not provide an adequate solution, because the optimal path depends on intermediate information concerning experienced traversal times on traveled arcs. Thus, a set of strategies, referred to as hyperpaths, are generated to provide directions to the destination node conditioned upon arrival times at intermediate locations. In this paper, an efficient label-setting-based algorithm is presented for determining the adaptive LET hyperpaths in STV networks. Such a procedure is useful in making critical routing decisions in intelligent transportation systems (ITS) and data communication networks. A side-by-side comparison of this procedure with a label-correcting-based algorithm for solving the same problem is made. Results of extensive computational tests to assess and compare the performance of both algorithms, as well as to investigate the characteristics of the resulting hyperpaths, are presented. An illustrative example of both procedures is provided.

MSC:
90B36Scheduling theory, stochastic
90B06Transportation, logistics
WorldCat.org
Full Text: DOI