Creating a route based on GPS proximity

Filter the table and sort any column smallest to largest.

So, is it really some kind of "shortest path" algorithm that you are trying to do here? http://www.excel-easy.com/examples/s...h-problem.html

So a "shortest path -- greedy algorithm style" type algorithm? Just trying to make sure I understand exactly what you are trying to do.

In the other shortest path algorithms, the "don't repeat a node" seems to be handled by the constraint that "flow into a node"-"flow out of node"=0. I would probably expect that the "don't duplicate a node" part of the algorithm probably includes some formula to count flow in/flow out of each node.

In searching for other sample spreadsheets, I came across this shortest path algorithm tutorial with a couple of sample sheets: https://networkmodels.weebly.com/excel-solver.html One of their examples looks more like the 2D distance matrix that you have, so it might be more helpful.

I think if I were doing this, I would probably start with one of these shortest path problem spreadsheets/examples, and make sure I understand exactly how it works. Once I understand how those examples work, I would structure your data in a similar way -- with nodes and arcs and such. Once I have the spreadsheet set up (with or without the Solver model), then I can work on the "greedy algorithm" part of the problem.

(FWIW, I started trying to develop the greedy algorithm and thought that it looked easier with the arcs in list format like the Excel Easy example rather than in the 2D matrix format, but I did not explore it in depth. Whichever approach is going to require some thought towards data structure.)