Location Problems with Cutoff

DOI10.1142/S0217595922500452MaRDI QIDQ6053539zbMATH OpenOpenAlexFDO

Authors Raoul Müller, Anita Schöbel, Dominic Schuhmacher

Publication date 19 October 2023

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.00910

zbMATH Keywords

optimizationcutofflocation theoryWeber problembarycenterlimited distances

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Abstract: In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C>0$, and we allow for the option of an $empty$ solution at a fixed cost $C^{\prime }$. We analyze under which circumstances these problems can be reduced to the simpler Weber problem, and also when we definitely have to solve the more complex problem with cutoff. We furthermore present adaptions of the algorithm of [Drezner et al., 1991, $Transportation$ $Science$ 25(3), 183--187] to our setting, which in certain situations are able to substantially reduce computation times as demonstrated in a simulation study. The sensitivity with respect to the cutoff value is also studied, which allows us to provide an algorithm that efficiently solves the problem simultaneously for all $C>0$.

Recommendations

• Location problems
• Some reverse location problems
• scientific article; zbMATH DE number 1803765
• Cut-offs and their neighbors
• The locator problem
• Location problems with different norms for different points
• Fractional location problems
• Fixed gate point location problems
• scientific article; zbMATH DE number 65772

Cites work

• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 1855792 (Why is no real title available?)
• An improved column generation algorithm for minimum sum-of-squares clustering
• Localization in single facility location
• Location science
• Location theory. A unified approach
• Median hyperplanes in normed spaces -- a survey
• Metrics and barycenters for point pattern data
• New heuristic algorithms for solving the planar p-median problem
• On a circle placement problem
• On the computational complexity of finding a sparse Wasserstein barycenter
• Scaling algorithms for unbalanced optimal transport problems
• The Facility Location Problem with Limited Distances
• The Weber obnoxious facility location model: a big arc small arc approach
• The \(p\)-median problem: a survey of metaheuristic approaches

Cited in

(2)

• Location problems
• Some reverse location problems

This page was built for publication: Location Problems with Cutoff

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053539)