查询词典 traveling salesman problem

The Chinese Traveling Salesman Problem is one of combinatorial optimization problems, and is a NP.

中国旅行商问题是一个组合优化问题，是一个NP问题。

By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization algorithm is proposed to solve traveling salesman problem.

摘要利用混沌运动的遍历性、随机性和规律性等特点，提出了一种求解旅行商问题的混沌蚁群算法。

In allusion to traveling salesman problem existing in the Euclidean space,the strategy, simplifying the initial edge set,is put forwards to improve the efficiency of the algorithm.

针对欧氏空间的旅行商问题求解，提出了通过化简初始边集的策略，改善算法的求解效率，通过实验说明了该策略的有效性。

Based on the research on traveling salesman problem, a scheduling algorithm based on exchange is presented. As is demonstrated by experiments, the results from our algorithm, as far as we know, are the best.

5借鉴了研究旅行商问题的成果，从而提出了基于交换的调度算法，其实验结果超过了我们见到的调度结果。

This paper extends the ant colony algorithm which is used for solving 0-1 knapsack problem in reference [7], and gets enlightenment from the ant colony algorithm with 2-opt local optimization for solving traveling salesman problems: Exchange strategy can make the algorithm have faster convergence rate and get better quality solution. So this paper presents the ant colony algorithm based on exchange stragegy.

本文推广了文献[7]中求解单维0-1背包问题的蚁群算法，并从结合2-opt等局部优化的蚁群算法求解旅行商问题中得到启示：通过交换策略可以加快算法的收敛速度和获取更高质量的解，因此提出了基于交换策略的蚁群算法。

The realization of traveling salesman problem, to find the shortest route through all the points and back to square one.

详细说明：旅行商问题的实现，用来寻找一个最短的路线通过所有的点并回到原点。

A less obvious application is that the minimum spanning tree can be used to approximately solve the traveling salesman problem.

不太显而易见的应用是，最小生成树可用于大约解决旅行商问题。

Traveling salesman problem is of important theoretical and practical significance and applied widely in engineering practice.

旅行商问题具有重要的理论和实际研究价值，在工程实践中应用广泛。

This is a very good algorithm used in multi-source for Traveling Salesman Problem.

详细说明：这是一个很好用的多算法求解旅行商问题的源码。

A novel genetic algorithm is proposed in this paper for solving traveling salesman problem.

对旅行商问题设计了一个新的遗传算法。

In the days of sailing vessels the crew were afraid they would be becalmed on the ocean.

在使用帆船的时代，船员们担心他们会因为无风而无法在海洋上航行。

As long as foreign donors pay the PA's salary bill, few expect a new intifada.

只要外国继续为巴权力机构的薪水买单，希望发动新暴动的人便寥寥无几。