New stochastic models for capacitated location-allocation problem
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper we address the problem of locating p mobile service units in an n-dimensional space minimizing the expected response time. It is shown that an optimal solution to the problem is a degenerate distribution for the service, concluding that it is optimal to park the p units. This extends previous results in the literature for location on a segment.