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 procedure to adjust transit trip departure times through minimizing the maximum headway. (English) Zbl 0744.90028
Summary: Transit frequency is usually determined at the heavier load route segment, whereas at other segments the operation may be inefficient due to situations characterized by empty seats. The transit schedulers attempt to overcome this problem by deleting manually some departure times to allow for the initiation of certain trips beyond the beginning of the route and/or termination --- before the end of the route. The outcome of this process is the reduction of the number of vehicles required to carry on the timetable. This work describes an automated procedure for the scheduler to adjust the number of departures at each route timepoint to that required from a passenger load standpoint. Given a complete timetable, the procedure reduces the number of departures with the objective to minimize the maximum headway to be obtained, where the headway is associated with passenger wait time. This minimax headway problem is solved through: (i) representation of the problem on a directed network with a special pattern; (ii) applying a modified shortest-path algorithm on the network to determine the minimax headway; and (iii) applying an algorithm to ensure that the exact number of required departures will be included in the optimal solution. Finally, some computational results and an example are demonstrated.

MSC:
90B06Transportation, logistics
90-08Computational methods (optimization)
90C35Programming involving graphs or networks
WorldCat.org
Full Text: DOI
References:
[1] Wren, A.: Computer scheduling of public transport: urban passenger vehicles and crew scheduling. (1981) · Zbl 0474.90033
[2] Rousseau, J. M.: Computer scheduling of public transport 2. (1985) · Zbl 0569.90014
[3] Daduna, J. R.; Wren, A.: Computer-aided-transit schedules. (1988) · Zbl 0687.90093
[4] Desrochers, M.; Rousseau, J. M.: Computer-aided scheduling of public transport. (1991) · Zbl 0790.90030
[5] Dijkstra, E. W.: A note on two problems in connection with graphs. Numer. math. 1, 269-271 (1959) · Zbl 0092.16002
[6] Ceder, A.: Optimal design of transit short-turn trips. Transport. res. Record 1221, 8-22 (1990)
[7] Ceder, A.; Stern, H. L.: Deficit function bus scheduling with deadheading trip insertions for fleet size reductions. Trans. sci. 15, 338-363 (1981)
[8] Stern, H. L.; Ceder, A.: An improved lower bound to the minimum fleet size problem. Trans. sci. 17, 471-477 (1983)