Optimal Positioning of a Mobile Service Unit on a Line
In this paper we address the problem of locating a mobile response unit when demand is distributed according to a random variable on a line. Properties are proven which reduce the problem to locating a non-mobile facility, transforming the original optimization problem into an one-dimensional convex...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2002 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107718 |
| Acceso en línea: | https://hdl.handle.net/11441/107718 https://doi.org/10.1023/A:1020993417646 |
| Access Level: | acceso abierto |
| Palabra clave: | location facilities planning and design stochastic location patrolling |
| Sumario: | In this paper we address the problem of locating a mobile response unit when demand is distributed according to a random variable on a line. Properties are proven which reduce the problem to locating a non-mobile facility, transforming the original optimization problem into an one-dimensional convex program. In the special case of a discrete demand (a simple probability measure), an algorithm which runs in expected linear time is proposed. |
|---|