Article ID: | iaor20041976 |
Country: | United States |
Volume: | 50 |
Issue: | 9 |
Start Page Number: | 614 |
End Page Number: | 637 |
Publication Date: | Sep 2003 |
Journal: | Naval Research Logistics |
Authors: | Francis R.L., Lowe T.J., Tamir A., Rayco M.B. |
When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1-median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row–column aggregations, and make use of aggregation results for 1-median problems on the line to do aggregation for 1-median problems in the plane. The aggregations developed for the 1-median problem are then used to construct approximate