Exploiting Self-Canceling Demand Point Aggregation Error for Some Planar Rectilinear Median Location Problems

Naval Research Logistics

Volumn 50, Issue 6, 2003, Pages 614-637

  Francis, R L ^a   Lowe, T J ^b   Rayco, M B ^c   Tamir, A ^d  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF IOWA   (United States)

^c UNIVERSITY OF MIAMI   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; ERROR ANALYSIS; INTEGER PROGRAMMING; PROBLEM SOLVING;

DEMAND POINTS;

LARGE SCALE SYSTEMS;

EID: 0141828940     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10079     Document Type: Article

References (35)

1. G. Andersson, R.L. Francis, T. Normark, and M.B. Rayco, Aggregation method experimentation for large-scale network location problems, Location Sci 6 (1998), 25-39.
2. M. Avriel, Nonlinear programming: Analysis and methods, Prentice Hall, Englewood Cliffs, NJ, 1976.
3. P.A. Casillas, "Data aggregation and the p-median problem in continuous space," Spatial analysis and location allocation models, A. Ghosh and G. Rushton (Editors), Van Nostrand Reinhold, New York, 1987, pp. 327-244.
4. K.R. Chelst, J.P. Schultz, and N. Sanghvi, Issues and decision aids for designing branch networks, J Retail Bank X(2) (Summer 1988), 5-17.
5. F. Conti, F. Malucelli, S. Nicoloso, and B. Simeone, On a 2-dimensional equipartition problem, Eur J Oper Res 113 (1999), 215-231.
6. P.D. Domich, K.L. Hoffman, R.H.F. Jackson, and M.A. McClain, Locating tax facilities: A graphics-based microcomputer optimization model, Manage Sci 37 (1991), 960-979.
7. E. Erkut and B. Bozkaya, Analysis of aggregation errors for the p-median problem, Comput Oper Res 26 (1999), 1075-1096.
8. R.L. Francis and T.J. Lowe, On worst-case aggregation analysis for network location problems, Ann Oper Res 40(4) (1992), 229-246.
9. R.L. Francis and J.A. White, Facility layout and location, Prentice-Hall, Englewood Cliffs, NJ, 1974, inequality (7.21), p. 299; extensions in problem 7.25, p. 324.
10. R.L. Francis and J.A. White, Facility layout and location, Prentice-Hall, Englewood Cliffs, NJ, 1974, inequality (7.21), p. 299; extensions in problem 7.25, p. 324.
11. R.L. Francis, T.J. Lowe, and M.B. Rayco, Row-column aggregation for rectilinear p-median problems, Transportation Sci 30 (1996), 160-174.
12. R.L. Francis, T.J. Lowe, G. Rushton, and M.B. Rayco, A synthesis of aggregation methods for multi-facility location problems: strategies for containing error, Geogr Anal 31 (1999), 67-87.
13. R.L. Francis, T.J. Lowe, and A. Tamir, On aggregation error bounds for a class of location models, Oper Res 48 (2000), 294-307.
14. R.L. Francis and M.B. Rayco, Asymptotically optimal aggregation for some unweighted p-center problems with rectilinear distances, Stud Locational Anal 10 (1996), 25-36.
15. G.N. Frederickson, Optimal algorithms for partitioning trees and locating p-centers in trees, Technical Report CSD-TR-1029, Purdue University, West Lafayette, IN, 1991.
16. G.N. Frederickson, Optimal algorithms for partitioning trees and locating p-centers in trees, Proc Second ACM-SIAM Symp Discrete Algorithms, San Francisco, 1991, pp. 168-177.
17. A. Geoffrion, Objective function approximations in mathematical programming, Math Program 13 (1977), 23-37.
18. G. Hardy, J.E. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge, 1934.
19. R. Hassin and A. Tamir, Improved complexity bounds for location problems on the real line, Oper Res Lett 10 (1991), 395-402.
20. E. Hillsman and R. Rhoda, Errors in measuring distances from populations to service centers, Ann Regional Sci 12 (1978), 74-88.
21. S. Khanna, S. Muthukrishnan, and S. Skiena, Efficient array partitioning, Proc 24th Int Coll Automata, Languages and Programming, 1997, pp. 616-626.
22. O.L. Mangasarian, Nonlinear programming, McGraw-Hill, New York, 1969.
23. F. Manne and T. Sorevik, Optimal partitioning of sequences, J Algorithms 19 (1995), 235-249.
24. N. Megiddo and K. Supowit, On the complexity of some common geometric location problems, SIAM J Comput 13 (1984), 182-196.
25. 2 n) algorithm for the unweighted p-center problem on the line, Technical Report 1981, revised 1991, Department of Statistics, Tel Aviv University, Tel Aviv, Israel.
26. 2 n) algorithm for the kth longest path in a tree with applications to location problems, SIAM J Comput 10 (1981), 328-337.
27. A.T. Murray and J.M. Gottsegen, The influence of data aggregation on the stability of p-median location model solutions, Geogr Anal 29 (1997), 200-213.
28. B. Olstad and F. Manne, Efficient partitioning of sequences, IEEE Trans Comput 44 (1995), 1322-1326.
29. F. Plastria, On the choice of aggregation points for continuous p-median problems: A case for the gravity centre, TOP 9 (2001), 217-242.
30. F. Plastria, New error bounds in continuous minisum location for aggregation at the gravity centre, Stud Locational Anal 14 (2000), 101-119.
31. M.B. Rayco, R.L. Francis, and T.J. Lowe, Error-bound driven demand point aggregation for the rectilinear distance p-center model, Location Sci 4 (1996), 213-236.
32. M.B. Rayco, R.L. Francis, and A. Tamir, A p-center grid-positioning aggregation procedure, Comput Oper Res (Special Issue on Aggregation & Disaggregation for Operations Research) 26 (1999), 1113-1124.
33. D.F. Rogers, R.D. Plante, R.T. Wong, and J.R. Evans, Aggregation and disaggregation techniques and methodology in optimization, Oper Res 39 (1991), 553-582.
34. E. Zemel, Probabilistic analysis of geometric location problems, SIAM J Alg Discrete Methods 6 (1985), 189-200.
35. P. Zhao and R. Batta, Analysis of centroid aggregation for the euclidean distance p-median problem, Eur J Oper Res 113 (1999), 147-168.