orloca

Operations Research LOCational Analysis Models

Last update: 7 February 2024

Copyright license: GNU General Public License

Software version identifier: 4.10, 5.3, 1.0, 2.0, 3.0, 3.1, 3.2, 4.0, 4.1, 4.2, 4.3, 4.5, 4.6, 4.8, 4.9, 5.6

Description

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

Cites work

Cited In (2)

This page was built for software: orloca