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)
The holding problem at multiple holding stations. (English) Zbl 1169.90329
Hickman, Mark (ed.) et al., Computer-aided systems in public transport. Selected papers based on the presentations at the 9th international conference, San Diego, CA, USA, August 9–11, 2004. Berlin: Springer (ISBN 978-3-540-73311-9/pbk). Lecture Notes in Economics and Mathematical Systems 600, 339-359 (2008).
Summary: Inherent stochasticity within the transit operating environment suggests there may be benefits of holding vehicles at more than one holding station on a route. In this paper, the holding problem at multiple holding stations considers holding vehicles at a given subset of stations on the route. By approximating the vehicle dwell time as the passenger boarding time, the holding problem at multiple holding stations can be modeled as a convex quadratic programming problem, with the objective function as a convex quadratic function subject to many linear constraints. This particular problem can be solved by a heuristic that decomposes the overall problem into sub-problems which can be solved to optimality. Also, a hypothetical numerical example is presented to illustrate the effectiveness of the problem formulation and heuristic.
MSC:
90B20Traffic problems
90C25Convex programming