5 ms·
If you have a helicopter and a burning desire to visit all 478 KFC locations in California, give this to your pilot: https://dl.dropboxusercontent.com/u/2293497
by dbarlett 13y ago
If you have a helicopter and a burning desire to visit all 478 KFC locations in California, give this to your pilot: https://dl.dropboxusercontent.com/u/22934979/CA_KFC_LK.jpg https://dl.dropboxusercontent.com/u/22934979/CA_KFC_LK.jpg. I used the 2D Euclidean distance between each location and the Lin-Kernighan heuristic [1], so scaling it out to the entire U.S. wouldn't be hard if the data was available.
[1] https://en.wikipedia.org/wiki/Lin%E2%80%93Kernighan_heuristic https://en.wikipedia.org/wiki/Lin%E2%80%93Kernighan_heuristi...
- Arelius 13y agoHow did you do this?
- dxbydt 13y agoVery impressive! Pls post a link to your code if you don't mind.
- dbarlett 13y agohttps://github.com/dbarlett/KFC-Tour https://github.com/dbarlett/KFC-Tour Now uses the the Concorde cutting-plane-based exact TSP solver. Edit: I really should have named the repo colonel-sanders.