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.