Random vehicle dispatching with options and optimal fleet size

A dispatching problem with random availability of vehicles and options to send rented vehicles is considered. We assume passenger arrivals to be described by a pure-birth process. Such a problem is analytically attractive and is shown to have practical applications in vehicle dispatching models. An average cost criterion is used to determine firm's fleet size and option (renting) strategy.     

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.