Noniterative solution of some Fermat-Weber location problems
Summary: The Fermat-Weber problem of optimally locating a service facility in the Euclidean continuous two-dimensional space is usually solved by the iterative process first suggested by Weiszfeld or by later versions thereof. The methods are usually rather efficient, but exceptional problems are described in the literature in which the iterative solution is exceedingly long. These problems are such that the solution either coincides with one of the demand points or nearly coincides with it. We describe a noniterative direct alternative, based on the insight that the gradient components of the individual demand points can be considered as pooling forces with respect to the solution point. It is demonstrated that symmetrical problems can thus be optimally solved with no iterations, in analogy to finding the equilibrium point in statics. These include a well-known ill-conditioned problem and its variants, which can now be easily solved to optimality using geometrical considerations.
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Accelerating convergence in the Fermat-Weber location problem
- On Newton's method for the Fermat-Weber location problem
- The Fermat-Weber location problem revisited
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Geometrical properties of the Fermat-Weber problem
- Accelerating convergence in the Fermat-Weber location problem
- The Fermat-Weber location problem revisited
- Analysing a few trigonometric solutions for the Fermat-Weber facility location triangle problem with and without repulsion and generalising the solutions
- On Newton's method for the Fermat-Weber location problem
- An improved method for the solution of the problem of location on an inclined plane
- A Solution to the Weber Location Problem on the Sphere
- scientific article; zbMATH DE number 3976799 (Why is no real title available?)
- Algorithms for location problems based on angular distances
- A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- The Fermat-Weber location problem in single integrator dynamics using only local bearing angles
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
This page was built for publication: Noniterative solution of some Fermat-Weber location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666407)
