Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.R. Anderson and R.A. Fontenot, Optimal positioning of service unit along a coordinate line, Transportation Science 26(4) (1992) 346-351.
O. Berman and R.C. Larson, The median problem with congestion, Computers and Operations Research 9 (1982) 119-126.
P.J. Bickel and K.A. Doksum, Mathematical Statistics: Basic Ideas and Selected Topics (Holden-Day, 1977).
E. Carrizosa, E. Conde, M. Muñoz-Márquez and J. Puerto, The generalized Weber problem with expected distances, RAIRO Recherche Opérationnelle/Operations Research 29 (1995) 35-57.
E. Carrizosa, M. Muñoz-Márquez and J. Puerto, Location and shape of a rectangular facility in Rn: Convexity properties, Mathematical Programming 83 (1998) 277-290.
E. Carrizosa, M. Muñoz-Márquez and J. Puerto, A note on the optimal positioning of service units, Operations Research 46 (1998) 155-156.
S.S. Chiu and R.C. Larson, Locating an n-server facility in a stochastic environment, Computers and Operations Research 12 (1985) 509-516.
R.L. Francis, L.F. McGinnis and J.A. White, Facility Layout and Location: An Analytical Approach (Prentice-Hall, Englewood Cliffs, 1992).
F.N. Fritsch, R.E. Schafer and W.P. Crowley, Solution of tracendental equation wew = x, Communications of the ACM 16 (1973).
Y. Gerchak and X. Lu, Optimal anticipatory position of a disk arm for queries of random length and location, INFOR 34(4) (1996) 251-262.
J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Vols. 1 and 2 (Springer, Berlin, 1993).
R.P. King, Disk arm movement in anticipation of future requests, ACM Transactions on Computer Systems 8 (1990) 214-229.
R. Larson and A. Odoni, Urban Operations Research (Prentice-Hall, Englewood Cliffs, NJ, 1981).
R.C. Larson, A hypercube queuing model for facility location and restricting in urban emergency services, Computers and Operations Research 1 (1974) 67-95.
A. Levine, A patrol problem, Mathematical Magazine 59 (1986) 159-166.
X. Lu and Y. Gerchak, Multiple anticipatory moves of a server on a line, Location Science 5(4) (1997) 269-287.
D.E. Luenberger, Linear and Nonlinear Programming, 2nd ed. (Addison-Wesley, 1989).
M. Muñoz-Márquez, El problema de Weber regional, Ph.D. thesis, Universidad de Sevilla (1995).
F. Plastria, Continuous location problems, in: Facility Location. A Survey of Applications and Methods, ed. Z. Drezner (Springer, 1995) chapter 11.
A.M. Rodríguez Chía, Avances sobre el problema de localización contínua de un único centro, Ph.D. thesis, Universidad de Sevilla (1998).
R.G. Vickson and Y. Gerchak, Optimal positioning of read/write heads in mirrored disks, Location Science 3(2) (1995) 125-132.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carrizosa, E., Muñoz-Márquez, M. & Puerto, J. Optimal Positioning of a Mobile Service Unit on a Line. Annals of Operations Research 111, 75–88 (2002). https://doi.org/10.1023/A:1020993417646
Issue Date:
DOI: https://doi.org/10.1023/A:1020993417646