In this paper we address the problem of locating p mobile service unit
s in an n-dimensional space minimizing the expected response time. It
is shown that an optimal solution to the problem is a degenerate distr
ibution for the service, concluding that it is optimal to park the p u
nits. This extends previous results in the literature for location on
a segment.