A Java SWING program I wrote to demonstrate Simulated Annealing solving The Traveling Salesman Problem. Simply put, "What is the shortest distance I can travel to include all cities without visiting the same one twice?"
I believe the UI was originally generated using CodeWarrior.
I think I wrote this in the late '90s. It is still fun today. I added a couple quirks from my playing with genetic algorithms (that really didn't do much to find better minimums.)