The Weber problem
From MaRDI portal
The main object of this chapter is to put into perspective the efforts of many people in different disciplines who struggled with various versions of the Weber problem: given \(n\) fixed points, find a facility location that minimizes all objective function depending on the distance between the facility and the fixed points. In particular one can find the Weber problem history, from Cavalieri, Fermat and Torricelli through Simpson, Steiner, Varignon and Weiszfeld up to Tellier, with a description of geometrical, physical and algorithmic solution methods. Two properties of the problem are described. The first are necessary and sufficient conditions so that the optimum location occurs at a fixed point. The second is the probability that the optimum location occurs at a fixed point. One can also find a review of various metrics used, \(l_p\) \((p\geq 1)\), block norms and polyhedral gauges. For \(l_1\) and \(l_2\) metrics the problem is easy to solve whereas this is not the case for \(l_p\), \(p>2\). Various extensions of the Weber problem are also reviewed: the multiple facilities problem, the restricted Weber problem, and the localization of dimensional facilities. For the entire collection see [Zbl 0988.00044].
Recommendations
Cited in
(only showing first 100 items - show all)- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Optimal placement of a deposit between markets: Riemann-Finsler geometrical approach
- Contour approximation of data: a duality theory
- The projection median of a set of points
- On the point for which the sum of the distances to n given points is minimum
- Combined location-routing problems -- a neural network approach
- Local improvement in planar facility location using vehicle routing
- Geometrical properties of the Fermat-Weber problem
- An optimal method for solving the (generalized) multi-Weber problem
- Weber problems with alternative transportation systems
- The Weber problem with regional demand
- Location of a moving service facility
- Bicriteria and restricted 2-facility Weber problems
- Robust facility location
- The planar multifacility collection depots location problem
- A generalization of the concept of distance based on the simplex inequality
- The Weber obnoxious facility location model: a big arc small arc approach
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Improved upper bounds for the Steiner ratio
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- A biobjective approach to recoverable robustness based on location planning
- Location analysis: a synthesis and survey
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- A flexible approach to location problems
- Fixed gate point location problems
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Extensions to the Weber problem
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- Analysing a few trigonometric solutions for the Fermat-Weber facility location triangle problem with and without repulsion and generalising the solutions
- Using the power of ideal solutions: simple proofs of some old and new results in location theory
- The obnoxious facilities planar \(p\)-median problem
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Weiszfeld's method: old and new results
- A bibliography for some fundamental problem categories in discrete location science
- Fermat-Steiner problem in the metric space of compact sets endowed with Hausdorff distance
- A directional approach to gradual cover
- The planar hub location problem: a probabilistic clustering approach
- The Wickstead Problem
- Matching point sets with respect to the earth mover's distance
- Some thoughts on generalized Weber location models
- Review of obnoxious facilities location problems
- An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming
- A generalized Weber problem with different gauges for different regions
- Solving Weber problem on plane with minimax criterion and forbidden gaps
- A heuristic algorithm for constrain single-source problem with constrained customers
- The Newton bracketing method for convex minimization: convergence analysis
- Stochastic Analysis of the Weber Problem on the Sphere
- On Newton's method for the Fermat-Weber location problem
- Open and closed random walks with fixed edgelengths in \(\mathbf{\mathbb{R}^d}\)
- A graphic representation of the solution of the Weber problem in the space of the weights
- scientific article; zbMATH DE number 3883901 (Why is no real title available?)
- How bad can the centroid be?
- Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations
- scientific article; zbMATH DE number 3869027 (Why is no real title available?)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization
- Improved starting solutions for the planar p-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- Continuous location of an assembly station
- On an extension of Weber problem with Euclidean distance
- scientific article; zbMATH DE number 4055340 (Why is no real title available?)
- scientific article; zbMATH DE number 4066586 (Why is no real title available?)
- scientific article; zbMATH DE number 4074780 (Why is no real title available?)
- scientific article; zbMATH DE number 1187122 (Why is no real title available?)
- On the Set of Optimal Points to the Weber Problem
- scientific article; zbMATH DE number 37089 (Why is no real title available?)
- A global optimization procedure for the location of a median line in the three-dimensional space
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- On the Set of Optimal Points to the Weber Problem: Further Results
- scientific article; zbMATH DE number 679868 (Why is no real title available?)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- Locating an axis-parallel rectangle on a Manhattan plane
- On a robustness property in single-facility location in continuous space
- The generalized Weber problem with expected distances
- Location on a One-Way Rectilinear Grid
- A historical perspective on location problems
- Facility location in normed linear spaces
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
- Computing the Conformal Barycenter
- scientific article; zbMATH DE number 7622570 (Why is no real title available?)
- Sequential location of two facilities: comparing random to optimal location of the first facility
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- Weber’s Class Number One Problem
- A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Single-facility Weber location problem based on the lift metric
- The Fermat-Steiner problem in the space of compact subsets of endowed with the Hausdorff metric
- Asymmetric distance location model
- The Weber Problem in a Multi-Storey Building
- Location Problems with Cutoff
- Explicit expressions and computational methods for the Fortet-Mourier distance of positive measures to finite weighted sums of Dirac measures
- The Weber Location Problem: The Threshold Objective
- Location Science in Canada
- A trajectory based heuristic for the planar \(p\)-median problem
- Weber problems with high-speed lines
- A combinatorial algorithm for the 1-median problem in R^d with the Chebyshev norm
- The obnoxious competitive facility location model
- Solving a minisum single facility location problem in three regions with different norms
This page was built for publication: The Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147656)
