Lably
Skip to content

Related on Lably

Through Geometry

The Weber problem generalizes the geometric median, which assumes transportation costs per unit distance are the same for all destination points, and the problem of computing the Fermat point, the geometric median of three points. For this reason it is sometimes called the Fermat–Weber problem, although the same name has also been used for the unweighted geometric median problem. The Weber problem is in turn generalized by the attraction–repulsion problem, which allows some of the costs to be negative, so that greater distance from some points is better.

Definition and history of the Fermat, Weber, and attraction-repulsion problems

In the triangle case, the Fermat problem consists in locating a point D with respect to three points A, B, C in such a way that the sum of the distances between D and each of the three other points is minimized. It was formulated by the famous French mathematician Pierre de Fermat before 1640, and it can be seen as the true beginning of both location theory, and space-economy. Torricelli found a geometrical solution to this problem around 1645, but it still had no direct numerical solution more than 325 years later. E. Weiszfeld published a paper in 1937 with an algorithm for the Fermat-Weber problem. As the paper was published in Tohoku Mathematical journal, and Weiszfeld immigrated to USA and changed his name to Vaszoni, his work was not widely known. Kuhn and Kuenne independently found a similar iterative solution for the general Fermat problem in 1962, and, in 1972, Tellier found a direct numerical solution to the Fermat triangle problem, which is trigonometric. Kuhn and Kuenne's solution applies to the case of polygons having more than three sides, which is not the case with Tellier's solution for reasons explained further on.

The Weber problem consists, in the triangle case, in locating a point D with respect to three points A, B, C in such a way that the sum of the transportation costs between D and each of the three other points is minimized. The Weber problem is a generalization of the Fermat problem since it involves both equal and unequal attractive forces (see below), while the Fermat problem only deals with equal attractive forces. It was first formulated, and solved geometrically in the triangle case, by Thomas Simpson in 1750. It was later popularized by Alfred Weber in 1909. Kuhn and Kuenne's iterative solution found in 1962, and Tellier's solution found in 1972 apply to the Weber triangle problem as well as to the Fermat one. Kuhn and Kuenne's solution applies also to the case of polygons having more than three sides.

In its simplest version, the attraction-repulsion problem consists in locating a point D with respect to three points A1, A2 and R in such a way that the attractive forces exerted by points A1, A2, and the repulsive force exerted by point R cancel each other out as it must do at the optimum. It constitutes a generalization of both the Fermat and Weber problems. It was first formulated and solved, in the triangle case, in 1985 by Luc-Normand Tellier. In 1992, Chen, Hansen, Jaumard and Tuy found a solution to the Tellier problem for the case of polygons having more than three sides.

Sign in to keep reading

8 more chapters are free with a Lably account.

More in Philosophers, historians, political and social scientists