Traveling Salesman: Difference between revisions
Jump to navigation
Jump to search
(Created page with '{{BlueM.Opt nav}} thumb|400px|Screenshot of TSP being solved in BlueM.Opt <blockquote> The Travelling Salesman problem (TSP) is a problem in combinato…') |
m (category) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{BlueM.Opt nav}} | {{BlueM.Opt nav}} | ||
[[File:TSP | [[File:TSP random ani.gif|thumb|300px|Animation of a Traveling Salesman Problem being solved in BlueM.Opt ]] | ||
<blockquote> | <blockquote> | ||
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 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. | ||
| Line 11: | Line 11: | ||
''under construction'' | ''under construction'' | ||
[[Category:BlueM.Opt | [[Category:BlueM.Opt]] | ||
Latest revision as of 04:07, 22 January 2018
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