Simulated annealing demonstration
Download URL | Author URL | Software URL
This is a Java application that demonstrates the Simulated Annealing algorithm with an attack on the "traveling salesman" problem. What is simulated annealing? Simulated annealing is a technique, which was developed to help solve large combinatorial optimization problems. It is based on probabilistic methods that avoid being stuck at local (non-global) minima. It has proven to be a simple but powerful method for large-scale combinatorial optimization. For practical purposes, simulated annealing has solved the famous traveling salesman problem: find the shortest of N! paths connecting N cities. Simulated annealing finds a very good approximation to the shortest path out of the huge number of all possible paths. Annealing is nature's trick to find extrema in very complicated situations. Simulated annealing mimics on a computer the natural process by which crystal lattices of glass or metal relax when heated. The molecules of hot glass or metal are free to move about. Temperature is
Related software (3)
Cheap travel
http://www.justthetax.com Finally a Cheap travel service where we provide promotional vacation certificates offered by resorts. All you pay is Room Tax for your Hotel Stay and Por ...
TSP Solver and Generator
TSP Solver and Generator is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. TSPSG may be useful for teachers to ...
Trick or Treat
Take the shortcuts and play trick or treat with neighbors!