travel salesman problem

基本解釋

Practice of Searching for a Solution to the Travel Salesman Problem;
研究求解中國貨郎擔(dān)問題最短回路的多項式時間算法。
The paper discusses the operational characteristics of warehouse and gives a common order picking optimal algorithm for travel salesman problem.
分析了自動化倉庫堆垛機(jī)揀選作業(yè)的運(yùn)行特點，給出了堆垛機(jī)揀選作業(yè)旅行商數(shù)學(xué)模型的常用優(yōu)化算法。
Problem Description: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel).
問題描述：旅行商問題某售貨員要到若干城市去推銷商品，已知各城市之間的路程（或旅費(fèi)）。

旅行商問題
Fourthly, General Particle Swarm Optimization (GPSO) model and its application in travel salesman problem are studied.
然后,研究了廣義粒子群優(yōu)化模型及其在旅行商問題的應(yīng)用。