On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
type: Item
instance of: scholarly article
title: On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
zbMATH Open document ID: 0994.90092
DOI: 10.1007/BF02579084
published in: Top
publication date: 2002-09-18T00:00:00Z
review text: The author treats a specific problem in solving continuous location problems. To handle efficiently large scale location-allocation problems it is necessary to aggregate the underlying sets of real data (e.g. customer locations) to obtain solvable models. At first a detailed analysis of the errors (pure aggregation errors, allocation errors) induced by data-aggregation is given, which is applied to the \(p\)-median objective function. In the following part it is shown how to choose the points at which to aggregate given groups of demand points so as to minimize the aggregation error. For \(p\)-median problems with Euclidean distances, arguments are given in favor of the gravity center of the groups, but these turn out to be much stronger for rectangular distances. Aggregating at the centroid also leads to much higher precision bounds on the errors for rectangular distances. Finally the author shows some numerical results, which are obtained validating the theoretical developments.
reviewed by: Joachim R. Daduna
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 1740553
zbMATH Keywords: continuous location
zbMATH Keywords: aggregation
zbMATH Keywords: error bound
zbMATH Keywords: location-allocation
zbMATH Keywords: \(p\)-median
author: Frank Plastria
MaRDI profile type: Publication
cites work: Q4542527
cites work: A projection method for \(l_ p\) norm location-allocation problems
cites work: The demand partitioning method for reducing aggregation errors in \(p\)-median problems
cites work: Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
cites work: The Weber problem with regional demand
cites work: Location-Allocation Problems
cites work: Sensitivity analysis of the optimal location of a facility
cites work: Analysis of aggregation errors for the \(p\)-median problem
cites work: On worst-case aggregation analysis for network location problems
cites work: Row-Column Aggregation for Rectilinear Distance p-Median Problems
cites work: Q4229609
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: New error bounds in continuous minisum location for aggregation at the gravity centre
cites work: An optimal method for solving the (generalized) multi-Weber problem
cites work: Q4367079
cites work: Q5767400
cites work: Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
full work available at URL: https://doi.org/10.1007/bf02579084
OpenAlex ID: W2046616289
description: scientific article; zbMATH DE number 1740553