Vehicle dispatching with competition
This paper considers a vehicle dispatching problem with competition. For Poisson arrival processes, three dispatching policies are considered, (i) a C-policy, consisting in sending a vehicle as soon as it is filled to capacity C, (ii) a T-policy, assuming an infinite capacity and consisting in sending a vehicle every T periods and (iii) a (T, C)-policy consisting in sending a vehicle every T periods or whenever it is filled to capacity C, whichever comes first. Two firm models with cooperating and non-cooperating solution modes are resolved and results summarized in a table. Applications and examples are resolved for demonstration purposes.
Year of publication: |
1979
|
---|---|
Authors: | Tapiero, Charles S. ; Zuckerman, Dror |
Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 13.1979, 3, p. 207-216
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Optimum excess-loss reinsurance : a dynamic framework
Tapiero, Charles S., (1980)
-
A note on the optimal control of a cash balance problem
Tapiero, Charles S., (1980)
-
Optimal investment policy of an insurance firm
Tapiero, Charles S., (1983)
- More ...