Production , Manufacturing and Logistics Worst-case analysis of demand point aggregation for the Euclidean p-median problem

Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it easier to solve. Most traditional research on demand point aggregation is either experimental or assuming uniformly distributed demand points in analytical studies. In this paper, we study demand point aggregation for planar p-median problem when demand points are arbitrarily distributed. Efficient demand aggregation approaches are proposed with the corresponding attainable worst-case aggregation error bounds measured. We demonstrate that these demand aggregation approaches introduce smaller worst-case aggregation error bounds than that of the honeycomb heuristic [Papadimitriou, C.H., 1981. Worst-case and probabilistic analysis of a geometric location problem. SIAM Journal on Computing 10, 542-557] when demand points are arbitrarily distributed. We also conduct numerical experiments to show their effectiveness.

[1]  Timothy J. Lowe,et al.  Row-Column Aggregation for Rectilinear Distance p-Median Problems , 1996, Transp. Sci..

[2]  M. L. Fisher,et al.  Probabilistic Analysis of the Planar k-Median Problem , 1980, Math. Oper. Res..

[3]  Timothy J. Lowe,et al.  Aggregation Error Bounds for a Class of Location Models , 2000, Oper. Res..

[4]  Christos H. Papadimitriou,et al.  Worst-Case and Probabilistic Analysis of a Geometric Location Problem , 1981, SIAM J. Comput..

[5]  Rajan Batta,et al.  Analysis of centroid aggregation for the Euclidean distance p-median problem , 1999, Eur. J. Oper. Res..

[6]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[7]  Erhan Erkut,et al.  Analysis of aggregation errors for the p-median problem , 1999, Comput. Oper. Res..

[8]  Timothy J. Lowe,et al.  On worst-case aggregation analysis for network location problems , 1993, Ann. Oper. Res..

[9]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[10]  Ronald H. Ballou,et al.  Measuring transport costing error in customer aggregation for facility location , 1994 .

[11]  S. Chopra,et al.  Supply Chain Management: Strategy, Planning & Operation , 2007 .

[12]  Timothy J. Lowe,et al.  Aggregation error for location models: survey and analysis , 2009, Ann. Oper. Res..

[13]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[14]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[15]  J. Current,et al.  Elimination of Source A and B Errors in p‐Median Location Problems , 2010 .

[16]  E. Hillsman,et al.  Errors in measuring distances from populations to service centers , 1978 .

[17]  M. John Hodgson,et al.  AGGREGATION ERROR EFFECTS ON THE DISCRETE-SPACE p-MEDIAN MODEL: THE CASE OF EDMONTON, CANADA , 1997 .

[18]  Eitan Zemel,et al.  Probabilistic analysis of geometric location problems , 1984, Ann. Oper. Res..

[19]  M. J. Hodgson,et al.  A GIS APPROACH TO ELIMINATING SOURCE C AGGREGATION ERROR IN P- MEDIAN MODELS. , 1993 .

[20]  Frank Plastria,et al.  On the choice of aggregation points for continuousp-median problems: A case for the gravity centre , 2001 .

[21]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .