In the companion paper we introduced a vehicle routing problem in which demands arrive via a temporal Poisson process, and uniformly distributed along a line segment. Upon arrival, the demands move perpendicular to the line with a fixed speed. A service vehicle, with speed greater than that of the demands, seeks to provide service by reaching the location of each mobile demand. In this paper we study a first-come- first-served (FCFS) policy in which the service vehicle serves the demands in the order in which they arrive. When the demand arrival rate is very low, we show that the FCFS policy can be used to minimize the expected time, or the worst-case time, spent by a demand before being served. We determine necessary and sufficient conditions on the arrival rate of the demands (as a function of the problem parameters) for the stability of the FCFS policy. When the demands are much slower than the service vehicle the necessary and sufficient conditions become equal. We also show that in the limiting case when the demands move nearly as fast as the service vehicle; (i) the demand arrival rate must tend to zero; (ii) every stabilizing policy must service the demands in the order in which they arrive, and; (iii) the FCFS policy is the optimal policy
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.