travelling salesman problem

英語（米国） (en-US) 英語（イギリス） (en-GB)

名詞

カナダ英語 イギリス英語

(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.

日本語の意味

巡回セールスマン問題：与えられた都市と各都市間を移動するコストをもとに、すべての都市を一度だけ訪問し、最後に出発点に戻る最も安いルートを求める、組合せ最適化問題。

英語の意味

(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.

このボタンはなに？

During the lecture, the professor used a graph to illustrate the travelling salesman problem and how heuristics can find near-optimal routes.

講義中、教授はグラフを用いて巡回セールスマン問題と、ヒューリスティックがどのように準最適な経路を見つけるかを説明した。

詳細

意味（1）

(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.