Advances in Operations Research

Volume 2011, Article ID 379505, 10 pages

http://dx.doi.org/10.1155/2011/379505

## Noniterative Solution of Some Fermat-Weber Location Problems

The Raymond & Beverly Sackler School of Physics and Astronomy, Tel Aviv University, Tel Aviv 69978, Israel

Received 5 April 2011; Accepted 17 June 2011

Academic Editor: I. L. Averbakh

Copyright © 2011 Reuven Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

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.

#### 1. Introduction

The modern problem of finding the optimal location of a service facility with respect to a given set of demand points has emerged from an old geometrical problem. According to Kuhn [1], it was first posed by Fermat early in the 17th century. Torriceli was the first to suggest a geometrical construction for the solution (see Krarup and Vajda [2]), and apparently Steiner solved it again in the 19th century. The problem states: given three noncollinear points, find a point such that the sum of distances to the given points is minimal. The solution is that if all the angles in the triangle formed by the three given points are smaller than 120°, the optimal location is the point from which lines, drawn radially to each demand point, form three 120° angles. Geometrical methods for finding this point were given in the literature (see, e.g., the Georg Pick Mathematical Appendix to the book by Weber [3], Wesolowsky [4], and Martini [5]). If the triangle contains an angle greater than or equal to 120°, then the optimal location is at that vertex. When more than 3 demand points are involved and when different demand points may have different weights, the problem is to minimize the cost function where is the number of given points, is the weight of the th point, and , the Euclidean distance between the th point with coordinates and the point to be located . The problem is often termed the Weber problem, following an important work by Weber [3].

In order to study the properties of the solution, one can write the first derivatives of (1.1), namely, A necessary condition for a point to be a solution is that the sums in (1.2) be equal to zero. Moreover, since the cost function (1.1) is known to be convex (see, e.g., [6]), if there is a local minimum, it must be a global one. Thus, the main aim is to find a point in which , which will be the optimal solution of the problem.

Setting (1.2) to zero yields These equations cannot be solved in closed form, and Weiszfeld [7] suggested an iterative process based on (1.3) (see also the English translation, Weiszfeld and Plastria [8]). Weiszfeld described the iteration scheme as Different suggestions for the first guess for have been given, the “center of gravity” being quite popular. Ostresh [9] and others (see, e.g., [10, 11]) have pointed out that, in fact, Weiszfeld’s method is a steepest descent method, namely, going in the direction given by (1.2), when the step size is determined by the denominator in (1.4). Ostresh has also shown that in many cases, doubling the step size expedites the iterative procedure. Special cases in which the Weiszfeld method does not converge efficiently to the optimal solution have been reported [1, 12–16]). These included cases in which the solution coincided or nearly coincided with one of the demand points. Katz [13] has shown that in cases where the optimal solution coincides with a demand point, the convergence may be sublinear; in some cases, this may result in an extremely slow convergence of the Weiszfeld process, as described in the third example below. Some remedies have been suggested to improve the convergence (e.g., [17–19]).

In some cases, the iterative procedure lands on a demand point which is not the optimum, and since the function is not differentiable at such point, the process cannot proceed. It should be pointed out that Ostresh [9] showed that this problem can be solved in most cases by identifying that the demand point where the solution point is stuck is not the optimal solution, moving away from it and continuing the Weiszfeld iterations. In this context, let us mention a conjecture by Chandrasekaran and Tamir [20] stating that “if the convex hull of the set of vertices is of full dimension, then the set of initial points for which the sequence generated by the Weiszfeld algorithm lands in a vertex is denumerable.” Brimberg [21] has attempted to resolve the open question of Chandrasekaran and Tamir by an analysis of the Jacobian matrix of the iteration function. He concludes that having a convex hull of full dimension is both a necessary and sufficient condition for the set to be denumerable. Cánovas et al. [16] refuted this result by providing counter examples. In a later work, Brimberg [22] resolves the problem. He shows that when the convex hull of the fixed points is contained in an affine subspace of , the set of starting points that terminate the Weiszfeld algorithm prematurely at a fixed point is nondenumerable under these general conditions. However, when the convex hull has full dimension , this set is guaranteed to be denumerable. Thus, the open question posed by Chandrasekaran and Tamir [20] is reclosed.

Note that several authors (e.g., [7]) showed that a demand point is the optimal minimum location if and only if its weight is larger than the norm of the vector sum of the individual gradient elements of the other demand points at the location of point , As pointed out by Chen [23], one may consider the mechanical analog in which in (1.1) is looked upon as a scalar field analogous to the potential in a gravitational or an electric field. The first derivatives in (1.2) can be regarded as the and components of the resultant force acting on the service point which is to be located optimally. From the “physical” point of view, an object is placed in a force field having attracting points distributed in the two-dimensional space. The object is attracted to each of the given points, the attraction toward the th point being proportional to the weight of the point . The direction of the force component is along the line connecting the particle and the -th point. As mentioned by Chen [23] and Wesolowsky [4], the strength of this force element is not dependent on the distance between the particle and the demand point. The problem is that of finding a stationary point for the particle in this field. As opposed to the cases of electrical and gravitational fields where no such stationary point exists, a minimum point always exists under the present circumstances.

It has been mentioned that one of the possibilities is that the solution coincides with one of the demand points. Since the cost function is not differentiable at a demand point, this may cause difficulty if the iterative process steps into a demand point, be it the optimum or not. The possibility of a coincidence of the solution with a demand point has been discussed by Katz [12], Kuhn [1], and others. Katz suggested to first check each demand point for optimality using (1.5) before proceeding with the iterations, and only if none of the demand points is found to be the optimum, should the iterative process be started.

In the next section, we briefly describe the mechanical analog to the Weber problem and then proceed to the class of problems which can be solved noniteratively, using the concept of the attractive force and a specific symmetry of the problem.

#### 2. The Mechanical Analog

In the Mathematical Appendix to the book by Weber [3], Pick describes an analog device previously invented by Varignon to solve the Weber problem (see also Wesolowsky [4]). His approach was mainly intuitive, but the rationale behind it was practically the same as that mentioned above of the potential field and the force concepts. A map of the area in question is placed on a board, and holes are drilled in the points where the demand locations are. Strings are passed through the holes, and weights proportional to the economic “weights” are hung on them. The other edges of the strings are tied together. It is quite obvious that the stationary situation reached after possibly a few oscillations is the equilibrium point, namely, the solution of the minimization problem. Obviously, the accuracy of the method is limited by the friction of the strings in the holes, and, in fact, it looks quite primitive when the alternative of an efficient numerical procedure is available. However, the mechanical analog gives an insight to the properties of the solution.

As explained, the force elements due to each of the demand points are radial in direction, but independent of the distance between the demand point and the location of the service facility. An interesting implication of this fact is that once the location of the solution is known, it is in fact also the solution of other problems in which each demand point can be anywhere along the ray connecting the service facility point and the demand point, and without changing its weight (see [4, 23]). Of course, this does not help in solving the problem, but it does give some understanding of the sensitivity of the solution to changes in the location of the demand point.

#### 3. Noniterative Solution of Some Weber Problems

As pointed out above, one kind of Weber problem that can be solved noniteratively is the scenario where the solution coincides with a demand point. In the present context, this takes place when the weight of a demand point at is larger than the resultant of all the other forces (for all ) at (see, e.g., [10, 23–25]). In the present work, we concentrate on direct solutions in which the service point does not coincide with a demand point. Obviously, this is an equilibrium point where the sum of the pulling forces is nil. The considerations made are very similar to those made in mechanical statics.

The first example is a problem given by Kuhn [1] to demonstrate the possibility that the Weiszfeld method does not converge at all to the optimal solution. The problem with four vertices in the plane is shown in Figure 1. Two demand points with weights are on the -axis at and , and two other demand points with are at and . Kuhn [1] shows that if the starting point for the iterations is , the Weiszfeld step takes us to the demand point A_{1}, which is not the optimum, and gets “stuck” there. As pointed out by Kuhn, the optimal solution is at the origin, . Let us show that by the use of the force concept, this result can be easily reached. From the symmetry of the problem, it is quite obvious that the solution is on the -axis. It is also obvious that it cannot be to the right of A_{2} since all the weights are pulling it to the left. Considering points between A_{1} and A_{2}, we can readily see that the forces of these demand points counterbalance each other, but A_{3} and A_{4} have force components that pull to the left. It is thus obvious that the solution must be between −20 and 20, at a point denoted . The force exerted by A_{3} is of 13 units along the line connecting it to , and it has a horizontal component of to the left, and the same is true for A_{4}. The solution point should be, as stated above, an equilibrium point where the resultant force is nil. With the given weights the components of the forces along the -axis must be balanced, namely,
which yields . From the lower triangle, it is clear that . From a basic trigonometric identity, . Thus, we get , which immediately yields , namely, the solution is at the origin.

The second example has a similar symmetry, but it seems to give a deeper insight into the possibilities of getting the solution noniteratively for symmetric problems. As shown in Figure 2, two equal-weight demand points are located at and . Two other demand points are located on the -axis, at and , with weights of and , respectively. Without loss of generality, we can assume that . Due to the symmetry, the optimal solution is expected to be on the positive side of the -axis, and we are looking for the solution , the location of the solution on the -axis. The pulling force of A_{1} is , and its component along the -axis is to the left.

The same is true for A_{2}, so together, they exert a force of to the left whereas the two -components cancel each other. The resultant force of the two weights on the -axis is . Therefore, the equilibrium condition is
From the lower triangle, it is evident that
and from (3.2) and (3.3), we can write by eliminating
By simple algebra,
Obviously, if and are kept constant and is increased, the solution point moves to the right. The value of is reached when the expression under the square root equals one, which occurs when
According to the previous discussion, for larger values of , the solution point remains at .

Similar considerations apply for other problems, where, for example, A_{1} and A_{2} are on the -axis in a symmetric manner. Also for given values of and , the demand points A_{3} and A_{4} can be moved along the -axis (provided A_{3} is still on the negative side and A_{4} on the positive side), and the solution does not change. The only difference may relate to the end point associated with (3.6). When gets larger, the solution point “gets stuck” at A_{4}. If A_{4} is located farther to the right, using (3.5), we can see, for example, that the condition for the solution to coincide with A_{4} located at is
Since is smaller than , should get larger for a given before the solution lands at .

Similar considerations can be made for problems with more demand points along the -axis and more pairs of points placed symmetrically with respect to the -axis.

We turn now to a problem presented by Drezner [14, 17] which is extremely difficult for the Weiszfeld algorithm. This is shown (not to scale) in Figure 3. It consists of five demand points, four located at the four corners of a unit square, , , , and with weight of 1 each and a fifth point located at with weight of 4. The solution is known to coincide with the latter demand point, but the Weiszfeld procedure requires millions of iterations to get within 0.001 of the optimum. Methods for improving this have been suggested, but we would like to show here that using the forces concept and the symmetry, for this problem and some interesting variants, the solution can be found noniteratively.

From the symmetry, it is evident that the solution should be along the diagonal. If we consider points on the diagonal close to the point at , the latter exerts a force of 4 units upward along the diagonal. The weights at and exert a unity force downwards along the diagonal. Each of the other points, at and , exerts a force of unity along the line connecting it with , and its component along the diagonal is slightly smaller than unity. Thus, no matter how close we are to , the total force downwards along the diagonal is slightly smaller than 4, and the solution point is pulled towards and it ends up at this point.

Let us consider now what happens in cases where the weight at is slightly smaller than 4. One can imagine that from a certain weight down, the solution will be somewhere along the diagonal, between and . Let us denote any point along the diagonal by where . Consider the angle shown in Figure 3. It is easily seen that Using the trigonometric identity we get The components of the weights at and along the diagonal are , and therefore, we can write their contribution to the force downward along the diagonal as For , we get (the angle here is denoted by in Figure 3). Note that the total pulling force downward along the diagonal is 3.9999475 due to the additional unity weights at and . Since gets larger for decreasing , is a slowly increasing function (for larger , gets smaller and gets larger). If is less than 3.99997475, there will be a point of equilibrium on the diagonal for . In order to find this point for a given value of the weight , let us invert the function . For , where , let us find . This will be the point along the diagonal where the forces of all the demand points balance. Starting from we readily get By insertion, we get, for example, ; ; . These, of course, are related to weights of 3.999, 3.9999, and 3.9999747, respectively at . To conclude this example, if the weight of the demand point at is larger than 3.99997475, this point is the optimum. If the weight at is slightly less than 3.99997475 ( slightly less than 1.99997475), the solution is on the diagonal, between and , can be determined by (3.13), and no iterations are required. Note that for the solution to be at , that is, , one gets ; therefore, for a weight of or lower, down to at , the solution coincides with the demand point at . For a weight smaller than at , the solution point is pulled further down along the diagonal. For a weight of zero at , the solution will be at .

#### 4. Conclusion

By the use of the concept of virtual forces, the components of the gradient of the objective function in the Fermat-Weber problem, some problems of this kind can be solved directly, with no iterations. A number of examples in which the demand points are distributed symmetrically with respect to some axis are shown. This includes problems for which the known iterative procedures perform poorly. In particular, the problem given in Figure 3 is of interest. Here, due to the special geometry of the problem, very minute changes in the weight of the demand point at cause large changes in the optimal location on the diagonal. This special property seems to be associated with the exceedingly large number of iterations needed to reach the minimum by using the Weiszfeld method.

#### References

- H. W. Kuhn, “On a pair of dual nonlinear programs,” in
*Nonlinear Programming*, J. Abadie, Ed., pp. 37–54, North-Holland, Amsterdam, The Netherlands, 1967. View at Google Scholar · View at Zentralblatt MATH - J. Krarup and S. Vajda, “On Torricelli's geometrical solution to a problem of Fermat,”
*IMA Journal of Mathematics Applied in Business and Industry*, vol. 8, no. 3, pp. 215–224, 1997. View at Google Scholar · View at Zentralblatt MATH - A. Weber,
*Über den Standort den Industrie*, University of Chicago Press, Chicago, Ill, USA, 1909. - G. O. Wesolowsky, “The Weber problem: history and perspectives,”
*Location Science*, vol. 1, no. 1, pp. 5–23, 1993. View at Google Scholar - H. Martini, “A geometric generalization of the Vecten-Fasbender duality,”
*Studies in Locational Analysis*, no. 10, pp. 53–65, 1996. View at Google Scholar · View at Zentralblatt MATH - C. D. Eilon, C. D. T. Watson-Gandy, and N. Christofides,
*Distribution Management, Mathematical Modeling and Practical Analysis*, Griffin, London, UK, 1971. - E. Weiszfeld, “Sur le point sur lequel la somme des distances de n points données est minimum,”
*Tôhoku Mathematical Journal*, vol. 43, no. 1, pp. 335–386, 1937. View at Google Scholar - E. Weiszfeld and F. Plastria, “On the point for which the sum of the distances to
*n*given points is minimum,”*Annals of Operations Research*, vol. 167, no. 1, pp. 7–41, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - L. M. Ostresh, Jr., “On the convergence of a class of iterative methods for solving the Weber location problem,”
*Operations Research*, vol. 26, no. 4, pp. 597–609, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - G. O. Wesolowsky, “Location in continuous space,”
*Geographical Analysis*, vol. 5, no. 2, pp. 95–112, 1973. View at Google Scholar - F. Plastria and M. Elosmani, “On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems,”
*TOP*, vol. 16, no. 2, pp. 388–406, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - I. N. Katz, “On the convergence of a numerical scheme for solving some locational equilibrium problems,”
*SIAM Journal on Applied Mathematics*, vol. 17, pp. 1224–1231, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - I. N. Katz, “Local convergence in Fermat's problem,”
*Mathematical Programming*, vol. 6, pp. 89–104, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Z. Drezner, “A note on the Weber location problem,”
*Annals of Operations Research*, vol. 40, no. 1–4, pp. 153–161, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. Drezner, “On the convergence of the generalized Weiszfeld algorithm,”
*Annals of Operations Research*, vol. 167, pp. 327–336, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - L. Cánovas, R. Cañavate, and A. Marín, “On the convergence of the Weiszfeld algorithm,”
*Mathematical Programming*, vol. 93, no. 2, pp. 327–330, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. Drezner, “A note on accelerating the weiszfeld procedure,”
*Location Science*, vol. 3, no. 4, pp. 275–279, 1995. View at Google Scholar - Y. Vardi and C.-H. Zhang, “A modified Weiszfeld algorithm for the Fermat-Weber location problem,”
*Mathematical Programming*, vol. 90, no. 3, pp. 559–566, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Rautenbach, M. Struzyna, C. Szegedy, and J. Vygen, “Weiszfeld's algorithm revisited once again,” Research Institute of Discrete Mathematics Report #04946-OR, University of Bonn, Bonn, Germany, 2004. View at Google Scholar
- R. Chandrasekaran and A. Tamir, “Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem,”
*Mathematical Programming*, vol. 44, no. 3, pp. 293–295, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Brimberg, “The Fermat-Weber location problem revisited,”
*Mathematical Programming*, vol. 71, no. 1, pp. 71–76, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Brimberg, “Further notes on convergence of the Weiszfeld algorithm,”
*Yugoslav Journal of Operations Research*, vol. 13, no. 2, pp. 199–206, 2003. View at Publisher · View at Google Scholar - R. Chen, “Optimal location of a service facility as a problem in basic mechanics,”
*American Journal of Physics*, vol. 53, no. 1, pp. 59–62, 1985. View at Google Scholar - H. Juel and R. F. Love, “Fixed point optimality criteria for the location problem with arbitrary norms,”
*Journal of the Operational Research Society*, vol. 32, no. 10, pp. 891–897, 1981. View at Google Scholar - I. Norman Katz and S. R. Vogl, “A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem,”
*Computers & Mathematics with Applications*, vol. 59, no. 1, pp. 399–410, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH