Traveling Salesman

From BlueM
Jump to: navigation, search

EVO.png BlueM.Opt | Downloads | Usage | Development | Bugs | SVN

Animation of a Traveling Salesman Problem being solved in BlueM.Opt

The Travelling Salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.

The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.

TSP in BlueM.Opt

under construction