salesman problem

基本解釋

One famous example is the travelling salesman problem—finding the shortest route between several cities.
其中一個(gè)著名的例子就是推銷員旅行問(wèn)題：找出幾個(gè)城市之間的最短路線。
TSP(Traveling Salesman Problem)is a typical NP-hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP.
TSP問(wèn)題是一個(gè)經(jīng)典的NP難度的組合優(yōu)化問(wèn)題，遺傳算法是求解TSP問(wèn)題的有效方法之一。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推銷員問(wèn)題是一個(gè)最受人喜愛(ài)的數(shù)學(xué)難題：如果一個(gè)推銷員不得不訪問(wèn)幾個(gè)城市，怎樣走最短的路線使他一次到達(dá)這幾個(gè)城市。

Adleman mimicked this process in the laboratory, and used it to solve something called the traveling-salesman problem.
FORBES: DNA May Make Computers, Not Run Them
You can solve the Traveling Salesman problem using glue and paper clips.
FORBES: Why Job Descriptions Are A Waste Of Paper
In this problem, a salesman must chart a path through seven cities in which he visits each one only once.
FORBES: DNA May Make Computers, Not Run Them