A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience

  • Authors:

  • M. Pavone;N. Bisnik;E. Frazzoli;V. Isler

  • Affiliations:

  • Laboratory for Information and Decision Systems, and the Aeronautics and Astronautics Department, Massachusetts Institute of Technology, Cambridge, USA 02139;Rensselaer Polytechnic Institute, Troy, USA 12180;Laboratory for Information and Decision Systems, and the Aeronautics and Astronautics Department, Massachusetts Institute of Technology, Cambridge, USA 02139;Rensselaer Polytechnic Institute, Troy, USA 12180

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the problem of designing motion strategies for a team of mobile agents, required to fulfill request for on-site service in a given planar region. In our model, each service request is generated by a spatio-temporal stochastic process; once a service request has been generated, it remains active for a certain deterministic amount of time, and then expires. An active service request is fulfilled when one of the mobile agents visits the location of the request. Specific problems we investigate are the following: what is the minimum number of mobile agents needed to ensure that a certain fraction of service requests is fulfilled before expiration? What strategy should they use to ensure that this objective is attained? This problem can be viewed as the stochastic and dynamic version of the well-known vehicle routing problem with time windows. We also extend our analysis to the case in which the time service requests remain active is itself a random variable, describing customer impatience. The customers' impatience is only known to the mobile agents via prior statistics. In this case, it is desired to minimize the fraction of service requests missed because of impatience. Finally, we show how the routing strategies presented in the paper can be executed in a distributed fashion.