Monday, 5 January 2009

Solving the Traveling Salesman problem using Simulated Annealing

The F#.NET Journal just published an article about combinatorial optimization:

"Finding the 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. 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 Windows Presentation Foundation. In particular, we show how the purely functional use of data structures facilitates an efficient lock-free way to obtain recent results for visualization..."

To read this article and more, subscribe to The F#.NET Journal today!

1 comment:

Brian Smith said...

Hello! Yesterday I found one new great book “Traveling Salesman Problem, Theory and Applications”
Book is free to download, or you just can read it on online reading platform here: This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering.