Operations Research LOCational Analysis Models
Cities of Andalusia
as-methods
as.data.frame.loca.p S3 method to convert from loca.p to data.frame
as.loca.p.data.frame S3 method to convert from data.frame to loca.p
as.loca.p.matrix S3 method to convert from matrix to loca.p
as.loca.p The following is for S3 compatibility, mainly for documentat...
as.matrix.loca.p S3 method to convert from loca.p to matrix
Plots of the min-sum objective function
Computes distsum function
Computes the gradient of distsum function
distsuml2 and distsuml2gra at orloca package
distsuml2min at orloca package
distsumlp and distsumlpgra at orloca package
distsumlpmin at orloca package
Returns the solution of the minimization problem
loca.p class for Operations Research LOCational Analysis
Operations Research LOCational Analysis Models
Modelos de Investigacion Operativa para el Analisis de Localizacion (O...
Plots of the min-sum objective function
plot of loca.p class objects
Random instances generator of loca.p class object
zsum
zsumgra
zsummin
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>.