Operations Research LOCational Analysis Models

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. .


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("orloca")

4.8 by Manuel Munoz-Marquez, 24 days ago


http://knuth.uca.es/orloca


Browse source code at https://github.com/cran/orloca


Authors: Manuel Munoz-Marquez <[email protected]>


Documentation:   PDF Manual  


Task views: High-Performance and Parallel Computing with R


GPL (>= 3) license


Imports grDevices, graphics, knitr, rmarkdown, stats

Depends on methods, png, ucminf


Depended on by RcmdrPlugin.orloca, orloca.es.


See at CRAN