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

Last 30 days

This package has been downloaded 448 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 15 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 6,632 times in the last 365 days. A solid achievement! Enough downloads to get noticed at department meetings. The day with the most downloads was Feb 27, 2025 with 61 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.