Article ID: | iaor20001567 |
Country: | Netherlands |
Volume: | 114 |
Issue: | 3 |
Start Page Number: | 447 |
End Page Number: | 464 |
Publication Date: | May 1999 |
Journal: | European Journal of Operational Research |
Authors: | Papastavrou Jason D., Swihart Michael R. |
Keywords: | programming: probabilistic, queues: applications |
In this paper a stochastic and dynamic model for the Pick-up and Delivery Problem is developed and analyzed. Demands for service arrive according to a Poisson process in time. The pick-up locations of the demands are independent and uniformly distributed over a service region. A single vehicle must transport the demands from the pick-up to the delivery location. Once a demand has been picked up it can only be dropped off at its desired delivery location. The delivery locations are independent and uniformly distributed over the region, and they are independent of the pick-up locations. The objective is to minimize the expected time in the system for the demands. Unit-capacity vehicle and multiple-capacity vehicle variations are considered. For each variation, bounds on the performance of the routing policies are derived for light and heavy traffic. The policies are analyzed using both analytical methods and simulation.