Found this article Computer Scientists Break Traveling Salesperson Record
A classic problem they teach in undergrad all over America.
“This optimization problem, which seeks the shortest (or least expensive) round trip through a collection of cities, has applications ranging from DNA sequencing to ride-sharing logistics. Over the decades, it has inspired many of the most fundamental advances in computer science, helping to illuminate the power of linear programming techniques. But researchers have yet to fully explore its possibilities — and not for want of trying.”
It turns out it is an incremental improvement. It uses a random path to get a non-optimal path for a certain situation. It isn’t a godsend or even a general solution. Still, it may represent a breakthrough and more people looking at the problem.
Site Updates
Planning on using insights from *Better Web Typography for a Better Web to make the site sexy. Read about 60 pages of it- very nice so far! I didn’t know a ton of the technical jargon involved.