search

N-Wouda / ALNS

Adaptive large neighbourhood search (and more!) in Python.
https://alns.readthedocs.io/en/latest/
MIT License
448 stars 124 forks source link

Add Example with adjacency matrix input #15

Closed niksust closed 4 years ago

niksust commented 5 years ago

I saw your example of the Traveling Salesman Problem to understand the solution and implementation of the ALNS. I was wandering if there was another example of TSP where the input is a distance matrix for nodes. The example TSP file is https://people.sc.fsu.edu/~jburkardt/datasets/tsp/gr17_d.txt

Thank you.

N-Wouda commented 5 years ago

I don't have code for this myself, but a distance matrix is a full specification of the TSP problem. As such, it should be possible to adapt the notebook to this case also. As for plotting solutions without any node coords, well, that might be a bit more difficult!

N-Wouda commented 5 years ago

@niksust I believe https://people.sc.fsu.edu/~jburkardt/datasets/tsp/gr17.tsp offers the same problem in TSP format. This might actually work with relatively minimal modification. Let me know how your efforts go!

N-Wouda commented 4 years ago

This issue has not seen activity for some time. Since it does not track an active bug, or feature request that directly relates to the core code, I have decided to close it for now.

If you feel this is in error @niksust, please let me know!