Friday, 9 January 2009

Solving the Traveling Salesman problem using Simulated Annealing

The OCaml Journal just published an article about combinatorial optimization:

"Finding global minima of an arbitrary function is a significantly more challenging problem than local function minimization and has many practical applications from the simulation of molecules to the design of printed circuit board layouts. Several different global function minimization algorithms exist, many of which make repeated use of local function-minimization algorithms. This article describes a simple and elegant solution to the traveling salesman problem that uses the simulated annealing approach to global function minimization. The results are visualized in real time using OpenGL. In particular, we use an efficient purely functional data structure to represent the path..."

To read this article and more, subscribe to The OCaml Journal today!

No comments: