zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
An urban bus network design procedure. (English) Zbl 1025.90003
Patriksson, Michael (ed.) et al., Transportation planning. State of the art. Selected papers of the 6th meeting of the EURO working group on transportation, Chalmers Univ. of Technology, Göteborg, Sweden, September 9-11, 1998. Boston: Kluwer Academic Publishers. Appl. Optim. 64, 177-195 (2002).
The paper presents a description of a heuristic iterative algorithm for an urban transit bus network. Inputs of the algorithm are demands of passangers defined by a demand matrix and company cost. The algorithm is divided into three phases. The first phase suggests the skeleton of the bus network by the demand matrix. The second phase defines express and main lines of the transit bus network and the third phase designs fedder lines of the transit bus network. This algorithm has been applied for Public Transit Netwok Design of the city of Rome. The paper contains a comparison between the proposed network and the current bus network of the city of Rome. For the entire collection see [Zbl 0992.00059].

90B20Traffic problems
90B10Network models, deterministic (optimization)