Queue-dependent vehicle dispatching with options and optimal fleet size
A queue-dependent vehicle dispatching rule, with options to use special vehicles (rented, reserve, shared etc.) for relieving long waiting lines, is considered. The transportation system under consideration has one source terminal and a fleet of N regular vehicles. Passengers are assumed to arrive individually at the source terminal according to a Poisson process. An efficient recursive algorithm is derived to analyse the performance of the system. An average cost criterion is used to determine the firm's fleet size and dispatching strategy for a simpler system. This is a variant of a "Random vehicle dispatching with options" rule proposed by Zuckerman and Tapiero (1980).
Year of publication: |
1982
|
---|---|
Authors: | Sim, S. H. ; Templeton, J. G. C. |
Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 16.1982, 3, p. 233-243
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Steady state results for the M/M(a, b)/c batch-service system,
Sim, S. H., (1985)
-
Sim, S. H., (1983)
-
Reliability of repairable redundant systems in nuclear generating stations
Sim, S. H., (1984)
- More ...