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)
A genetic algorithm for public transport driver scheduling. (English) Zbl 0812.90045
Summary: The problem of constructing daily shifts for public transport (generally bus) drivers is explained, and some of the currently available computer based solution methods are introduced. The need for improved methods is set out, and one of the more widely applied current methods is outlined in sufficient detail to show where new approaches may profitably be introduced. A feasibility study is described in which a simple genetic algorithm has been developed in order to examine the suitability of such an approach. This has required the development of a new crossover operator. Such an algorithm could ultimately replace part of the presented existing method, making it more efficient in terms of both of quality of result and of time taken to produce a good schedule. The simple algorithm has been shown to produce comparable results to the existing method on a test problem. The results encourage further investigation, but some complexities which can exist in real problems require further study. The results of the present experiments are presented, and the further complexities are discussed in the context of the genetic approach.
MSC:
90B06Transportation, logistics
68T05Learning and adaptive systems
92D10Genetics