TY - JOUR
T1 - Vehicle dispatching with competition
AU - Tapiero, Charles S.
AU - Zuckerman, Dror
PY - 1979/9
Y1 - 1979/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0018655504&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0018655504&partnerID=8YFLogxK
U2 - 10.1016/0191-2615(79)90012-2
DO - 10.1016/0191-2615(79)90012-2
M3 - Article
AN - SCOPUS:0018655504
SN - 0191-2615
VL - 13
SP - 207
EP - 216
JO - Transportation Research, Series B: Methodological
JF - Transportation Research, Series B: Methodological
IS - 3
ER -