orloca (4.6)

Operations Research LOCational Analysis Models.

http://knuth.uca.es/orloca
http://cran.r-project.org/web/packages/orloca

Objects and methods to handle and solve the min-sum location problem, also known as Fermat-Weber problem. The min-sum location problem search for a point such that the weighted sum of the distances to the demand points are minimized. See "The Fermat-Weber location problem revisited" by Brimberg, Mathematical Programming, 1, pg. 71-76, 1995. . General global optimization algorithms are used to solve the problem, along with the adhoc Weiszfeld method, see "Sur le point pour lequel la Somme des distances de n points donnes est minimum", by Weiszfeld, Tohoku Mathematical Journal, First Series, 43, pg. 355-386, 1937 or "On the point for which the sum of the distances to n given points is minimum", by E. Weiszfeld and F. Plastria, Annals of Operations Research, 167, pg. 7-41, 2009. .

Maintainer: Manuel Munoz-Marquez
Author(s): Manuel Munoz-Marquez <manuel.munoz@uca.es>

License: GPL (>= 3)

Uses: knitr, png, ucminf
Reverse depends: orloca.es, RcmdrPlugin.orloca

Released about 1 year ago.