knitr::opts_chunk$set( collapse = TRUE, comment = "#>", fig.width = 6, fig.height = 4 ) library('orloca')
In a problem of location, we seek to find the optimal location of a service, or a set of them, so that the quality that the service provides to a set of demand points is, according to a given performance measure, optimal. Some examples of localization problems are:
There are numerous contexts in which localization problems arise, due to this, the location theory has been object of great attention in recent years, being able to say that it is a subject of great importance. The appearance of new facets of the problem didn't handle until now contributes to this. For example, along with the already classic criteria for minimizing costs, new criteria appear: environmental, social, quality of life, etc. These new aspects of the problem make it an open field of study.
The package presented is devoted to solving the problem of locating a single point in the plane, using as an objective the minimization of the sum of the weighted distances to the demand points. New versions of the package will include new location models.
In a planar location problem, the set of demand points is given by the coordinates of said points. Optionally, a weighting can be assigned to said points, which gives more importance to some points than to others, since the objective considered is to minimize the weighted sum of the distances between the service point and said requesting assembly. For example, if the location of a regional hospital is sought, the demand points can be the towns to which the hospital must attend and the weights of the population of each locality.
For the resolution of these problems, a class of objects designated
loca.p has been defined, so that a
loca.p object stores the coordinates of the demand points and the weights of each of the points.
loca.p has three slots,
y that store the coordinates and
w that stores the weights.
When the weights are not given explicitly, all the points of demand will be considered equally important.
The rest of this section will explain how to do basic operations with loca.p objects.
Consider a location problem in which the set of demand points is $(0,0)$, $(4,0)$ and $(2,2)$.
To create a
loca.p object that represents that set, it can be done by calling the constructor function using the vector with the coordinates $x$ and the vector with the $y$ coordinates of the set of points as arguments:
loca.p(c(0, 4, 2), c(0, 0, 2))
loca.p(x = c(0, 4, 2), y = c(0, 0, 2))
The constructor has two more optional arguments, the third
w is used to specify a vector of weights and the fourth to specify a label that will be used to identify the object.
If, using the same set of points, we want to assign the weights 1, 1, 3, to said points and the label "Problem 1", we use:
loca.p(x = c(0, 4, 2), y = c(0, 0, 2), w = c(1, 1, 3), label = "Problem 1")
loca.p object can also be obtained by converting a
data.frame object that has the
y columns, and optionally
d <- data.frame(x = c(0, 10, 2), y = c(0, 0, 8), w = c(1, 3, 1))
you can build a
loca.p object by calling the
loca.p object can be converted into a
data.frame object by:
p1 <- loca.p(x = c(0, 4, 2), y = c(0, 0, 2), w = c(1, 1, 3), label = "Problem 1") as(p1, 'data.frame')
In conversions, the
label slot of the
loca.p object is stored as an attribute of the
The label can be read and modified by accessing them:
p1@label dp1 <- as.data.frame(p1) attr(dp1, "label")
loca.p objects can also be transformed into or constructed from objects of type
Random objects of class
loca.p can be created using the
The first argument,
n indicates the number of points to generate.
By default, these points are generated in the unit square $[0,1] \times [0, 1]$.
Thus, to generate a
loca.p object with 5 points in the unit square, we use:
ymax allow you to specify the rectangle in which the points will be generated.
In addition, the
rloca.p function allows you to specify the label for the new object.
For example, to generate the points in the rectangle $[- 1, 1] \times[-5,5]$ with the label "Rectangle" is used:
rloca.p(5, xmin = -1, xmax = 1, ymin = -5, ymax = 5, label = "Rectangle")
The points generated by the
rloca.p function can be generated in spatially distributed groups.
groups argument allows you to specify the number of groups by a number or the number of points in each group through a vector.
In this second case, the value given to the
n argument is ignored.
To randomly generate a demand set with three equal groups:
rloca.p(9, groups = 3, label = "Three equal groups")
for three unequal groups:
rloca.p(groups = c(2, 2, 5), label = "Three unequal groups")
To generate the data in groups, an offset of the center of each group is generated first and then the points are generated by adding to each point the offset that corresponds to their group.
For this reason,
groups = 1 is not equivalent to not specifying that parameter.
The offset of the centers can be specified by the arguments
To illustrate better how the function works, the result can be painted:
rl <- rloca.p(60, groups = 3, xmin = -10, xmax = 10, ymin = -10, ymax = 10, xgmin = -1, xgmax = 1, ygmin = -1, ygmax = 1, label = "Three groups") plot(rl)
To obtain a numeric summary of a
loca.p object you can use the
The summary shows the minimum, maximum and average values of both coordinates, in addition to the weighted averages of the coordinates of the points for each component.
loca.p object, we can evaluate the weighted distance from a given point.
Likewise, the gradient of said function can be evaluated and the problem of minimizing said objective can be solved.
The weighted average distance function is called
distsum in the package, given a point, for example: $(3, 1)$ you can evaluate the weighted average distance to a
pt3 <- loca.p(x = c(0, 4, 2), y = c(0, 0, 2), label = "Three points") distsum(o = pt3, x = 3, y = 1)
You can also calculate the gradient of
distsumgra(o = pt3, x = 3, y = 1)
To find the optimal solution to the previous location problem, use the
s <- distsummin(pt3) s
Evaluating the function and the gradient at the point obtained
distsum(o = pt3, x = s, y = s) distsumgra(o = pt3, x = s, y = s)
As can be verified by the value of the gradient, the solution found is a local optimum and, since the convex objective function, is a global optimum.
These three functions support an optional
lp argument, if this argument is omitted, the Euclidean standard is used, that is, the $l_2$ rule, if a value is specified for
lp the $l_p$ rule will be used for that value of $p$.
Note that specifying
lp = 2 uses the generic algorithm for the
l_p rule with $p$ equal to 2.
The use of the generic algorithm requires a greater computational effort to solve the problem, so it is not advisable to specify this argument to use the Euclidean norm.
loca.p objects and the objective function can be plotted in a graph.
For the objective function a representation based on level curves and another on a 3D graph is provided.
The graph of a
loca.p object consists of plotting the scatter plot of the set of demand points in the plane using the plot function:
The contour graph is made with the
In the graph you can see how the function reaches the minimum at the point previously calculated. Expanding:
contour(pt3, xlim = c(1.9, 2.1), ylim = c(1, 1.2), levels = c(5.465, 5.47, 5.475))
contour functions support an optional
img argument that allows you to specify a raster graphic to be used as the background of the graphic.
Analogously, a three-dimensional representation can be made using the
persp(pt3) persp(pt3, col = "lightblue", theta = 45, ltheta = 120, shade = 0.75, ticktype = "detailed")
The three representation functions will pass the remaining optional arguments to the generic function plot.
The data of the Andalusian capitals are loaded and it becomes a class object
data(andalusia) o <- loca.p(x = andalusia$x[1: 8], y = andalusia$y[1: 8])
The bounds values for the graph are calculated:
xmin <- min(andalusia$x) ymin <- min(andalusia$y) xmax <- max(andalusia$x) ymax <- max(andalusia$y)
The map of Andalusia is loaded and the points are represented with the background map
file = system.file('img', 'andalusian_provinces.png', package = 'orloca') img = readPNG(file) plot(o, img = img, main = 'Andalusia', xleft = xmin, ybottom = ymin, xright = xmax, ytop = ymax)
The contour graph is:
contour(o, img = img, main = 'Andalusia', xleft = xmin, ybottom = ymin, xright = xmax, ytop = ymax)
The optimal solution of the location problem with the 8 capitals, eight first rows, is obtained:
andalusia.loca.p <- loca.p(andalusia$x[1: 8], andalusia$y[1: 8]) sol <- distsummin(andalusia.loca.p) sol
The optimal solution provided by the algorithm is located about 35 km north of Antequera. Recall that Antequera is usually considered the geographic center of Andalusia. The graph presents the solution as a red dot:
contour(o, img = img, main = 'Andalusia', xleft = xmin, ybottom = ymin, xright = xmax, ytop = ymax) points(sol, sol, type = 'p', col = 'red')
For simplicity in the example, the terrestrial curvature has not been taken into account.
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.