News for hackers. Stuff that matters.

A comment on Show HN: Find the fastest route via a place. Parent comment

Re:Show HN: Find the fastest route via a place by dbarlett on Tuesday September 03, 2013 @11:37PM (#6325383)
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. 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_heuristi...

[ Parent | on HN ]
Re:Show HN: Find the fastest route via a place by dxbydt on Wednesday September 04, 2013 @02:33PM (#6329477)
Very impressive! Pls post a link to your code if you don't mind.
[ Parent | on HN ]
Re:Show HN: Find the fastest route via a place by dbarlett on Wednesday September 04, 2013 @11:01PM (#6331936)
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.

[ Parent | on HN ]
Re:Show HN: Find the fastest route via a place by Arelius on Wednesday September 04, 2013 @12:05AM (#6325475)
How did you do this?
[ Parent | on HN ]