Skip to main content

graphs and networks - FindShortestTour for charity (or: How can I optimize meal delivery with FindShortestTour?)


I've been wondering about this for a while - but never got around to asking - until I saw faleichik's incredible answer to Mathematica Minecraft.



I did some work at a not-for-profit a little while ago, which participated in a program called Meals On Wheels - wherein I helped to deliver food to those who are homebound. Myself and a partner would deliver meals to a daily list of addresses, sorted by name; not the most efficient route. The time to complete a route varied by as much as two hours because of it.


FindShortestTour, however, is only one (possible) part of the solution. I'd need to parse addresses, read map data, and handle the slight irregularities of NYC streets.


How can I use FindShortestTour to find the optimal meal delivery route, given a list of addresses?



Answer



When I did a similar job, it wasn't really the distance that made the difference. It would sometimes be quicker to drive 30 miles into the country for a drop than to try to cross the city at rush hour or during the school run. So it might be worth trying to work out the times between each drop and then find the route that has the shortest total time, rather than do it by distances on a map.


Here, rather clumsily derived, is a list of the different routes between, say, 8 places:


numberOfPlaces = 8;
edges = DeleteCases[
Map[#[[1]] \[DirectedEdge] #[[2]] &,
Tuples[Range[1, numberOfPlaces], {2}]],

x_ \[DirectedEdge] x_ /; x == x]

and we can assign times in minutes for travelling between each place, here just randomly. This is a bit of work initially, but most drivers would be able to estimate the times quite quickly.


randomweights = RandomInteger[{0, 45}, Length[edges]]


{17, 38, 25, 17, 9, 42, 7, 42, 11, 14, 40, 17, 4, 23, 4, ... 40}



Combine these with the edges:


edgeWeightRules = 

MapThread[
Rule, {edges, randomweights}] /.
(1 \[DirectedEdge] 4 -> n_) -> 1 \[DirectedEdge] 4 -> 200

I've set the value for traveling between places 1 and 4 to 200, for use later on. Next, draw a graph:


 cg = Graph[edges, 
VertexLabels -> "Name",
VertexStyle -> Red,
EdgeWeight -> edgeWeightRules,
EdgeLabels -> edgeWeightRules,

ImagePadding -> 10]

simple graph


This is not a physical map, but a picture showing the different travel times between different places. Then create a weighted adjacency graph:


wam = Normal[WeightedAdjacencyMatrix[cg]] /. 0 -> Infinity;
wag = WeightedAdjacencyGraph[wam,
EdgeShapeFunction ->
GraphElementData[{"DotLine", "ArrowSize" -> .01}],
VertexLabels -> "Name",
EdgeWeight -> edgeWeightRules,

EdgeLabels -> edgeWeightRules,
EdgeLabelStyle -> Directive[Gray, Italic, 12],
VertexLabelStyle -> Directive[Black, 16],
EdgeStyle -> Directive[LightGray],
ImagePadding -> 20]

weighted adjacency graph


Apparently, a Hamiltonian cycle is not a two-wheeled delivery device, but a path visting every vertex exactly once:


FindHamiltonianCycle[wag, All]



{{1 -> 2, 2 -> 3, 3 -> 4, 4 -> 5, 5 -> 6, 6 -> 7, 7 -> 1}



so we should find all of them, and then sort them by the total time each one takes:


routes = Sort[{Total[# /. edgeWeightRules], #} & /@ 
FindHamiltonianCycle[wag, All]]

This returns a list of all possible cycles, with the quickest one first. So the quickest route that turns up at all locations once takes 54 minutes (that's driving past and throwing the items out of the window...:).



{54, {1 -> 6, 6 -> 4, 4 -> 3, 3 -> 5, 5 -> 7, 7 -> 2, 2 -> 1}}




Then it's possible to investigate the different routes, using a Manipulate to step through the Hamiltonian cycles:


Manipulate[
Column[{
Row[{"length of ", Last[routes[[n]]], " is ", First@routes[[n]]}],
HighlightGraph[
wag,
PathGraph[
Last@routes[[n]],
DirectedEdges -> True],

GraphHighlightStyle -> "Thick",
ImageSize -> 400]
}], {n, 1, Length[routes], 1}]

manipulate for exploring the routes


The artificially slowed-down route shows up as being part of the longest cycles.


At least this approach avoids the problems of trying to find routes through the one-way systems of cities.


Comments

Popular posts from this blog

plotting - Plot 4D data with color as 4th dimension

I have a list of 4D data (x position, y position, amplitude, wavelength). I want to plot x, y, and amplitude on a 3D plot and have the color of the points correspond to the wavelength. I have seen many examples using functions to define color but my wavelength cannot be expressed by an analytic function. Is there a simple way to do this? Answer Here a another possible way to visualize 4D data: data = Flatten[Table[{x, y, x^2 + y^2, Sin[x - y]}, {x, -Pi, Pi,Pi/10}, {y,-Pi,Pi, Pi/10}], 1]; You can use the function Point along with VertexColors . Now the points are places using the first three elements and the color is determined by the fourth. In this case I used Hue, but you can use whatever you prefer. Graphics3D[ Point[data[[All, 1 ;; 3]], VertexColors -> Hue /@ data[[All, 4]]], Axes -> True, BoxRatios -> {1, 1, 1/GoldenRatio}]

plotting - Filling between two spheres in SphericalPlot3D

Manipulate[ SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, Mesh -> None, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], {n, 0, 1}] I cant' seem to be able to make a filling between two spheres. I've already tried the obvious Filling -> {1 -> {2}} but Mathematica doesn't seem to like that option. Is there any easy way around this or ... Answer There is no built-in filling in SphericalPlot3D . One option is to use ParametricPlot3D to draw the surfaces between the two shells: Manipulate[ Show[SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], ParametricPlot3D[{ r {Sin[t] Cos[1.5 Pi], Sin[t] Sin[1.5 Pi], Cos[t]}, r {Sin[t] Cos[0 Pi], Sin[t] Sin[0 Pi], Cos[t]}}, {r, 1, 2 - n}, {t, 0, Pi}, PlotStyle -> Yellow, Mesh -> {2, 15}]], {n, 0, 1}]

plotting - Mathematica: 3D plot based on combined 2D graphs

I have several sigmoidal fits to 3 different datasets, with mean fit predictions plus the 95% confidence limits (not symmetrical around the mean) and the actual data. I would now like to show these different 2D plots projected in 3D as in but then using proper perspective. In the link here they give some solutions to combine the plots using isometric perspective, but I would like to use proper 3 point perspective. Any thoughts? Also any way to show the mean points per time point for each series plus or minus the standard error on the mean would be cool too, either using points+vertical bars, or using spheres plus tubes. Below are some test data and the fit function I am using. Note that I am working on a logit(proportion) scale and that the final vertical scale is Log10(percentage). (* some test data *) data = Table[Null, {i, 4}]; data[[1]] = {{1, -5.8}, {2, -5.4}, {3, -0.8}, {4, -0.2}, {5, 4.6}, {1, -6.4}, {2, -5.6}, {3, -0.7}, {4, 0.04}, {5, 1.0}, {1, -6.8}, {2, -4.7}, {3, -1....