Crandore Hub

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 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. <DOI:10.1007/s10479-008-0352-z>.

Versions across snapshots

VersionRepositoryFileSize
5.6 rolling linux/jammy R-4.5 orloca_5.6.tar.gz 446.8 KiB
5.6 rolling linux/noble R-4.5 orloca_5.6.tar.gz 446.5 KiB
5.6 rolling source/ R- orloca_5.6.tar.gz 281.3 KiB
5.6 latest linux/jammy R-4.5 orloca_5.6.tar.gz 446.8 KiB
5.6 latest linux/noble R-4.5 orloca_5.6.tar.gz 446.5 KiB
5.6 latest source/ R- orloca_5.6.tar.gz 281.3 KiB
5.6 2026-04-26 source/ R- orloca_5.6.tar.gz 281.3 KiB
5.6 2026-04-23 source/ R- orloca_5.6.tar.gz 281.3 KiB
5.6 2026-04-09 windows/windows R-4.5 orloca_5.6.zip 454.5 KiB
5.6 2025-04-20 source/ R- orloca_5.6.tar.gz 281.3 KiB

Dependencies (latest)

Depends

Imports

Suggests