orloca: 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. <doi:10.1007/BF01592245>. 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.

Version: 4.5
Depends: methods, png, ucminf
Suggests: grDevices, graphics, knitr
Published: 2018-04-21
Author: Manuel Munoz-Marquez
Maintainer: Manuel Munoz-Marquez <manuel.munoz at uca.es>
License: GPL (≥ 3)
URL: http://knuth.uca.es/orloca
NeedsCompilation: no
Materials: ChangeLog
In views: HighPerformanceComputing
CRAN checks: orloca results


Reference manual: orloca.pdf
Vignettes: LocalizaciĆ³n plana con orloca
Planar Location with orloca
Package source: orloca_4.5.tar.gz
Windows binaries: r-prerel: orloca_4.3.zip, r-release: orloca_4.3.zip, r-oldrel: orloca_4.3.zip
OS X binaries: r-prerel: orloca_4.3.tgz, r-release: orloca_4.3.tgz
Old sources: orloca archive

Reverse dependencies:

Reverse depends: orloca.es, RcmdrPlugin.orloca


Please use the canonical form https://CRAN.R-project.org/package=orloca to link to this page.