How fast and accurate to solve the problem has now become a difficult point in the problem of TSP algorithm.
如何快速准确的解决TSP问题成为了现在TSP算法研究中的一个难点。
Finally, the paper presents DNA molecular algorithms and living examples of TSP problem based on sticker model.
最后给出了基于粘贴系统模型的TSP问题的DNA分子算法和应用实例。
As an essential question of the intelligent distribution system, route optimization has many problem-solving models, the most typical one is Traveling Salesman problem (short for TSP).
路径优化是物流配送中智能调度系统的核心问题，其中最典型的问题模型就是旅行商问题即TSP问题。
At first, it can support many kind of TSP (include TSP, ATSP and HCP), and can find the best tour of TSPLIB's majority problems in little time (the largest problem has a dimension of 7397 points).
首先，它广泛支持TSPLIB的TSP、ATSP、HCP类问题，对TSPLIB中大部分问题都在较短时间内求出了最优解，包括7397点的TSP问题。
Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.
求解tsp问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。
The question of flight path programming is TSP problem, regardless of other constraints. There are no effective real time algorithms of TSP problem at present.
无约束的航路规划问题，实际上是一个TSP问题，目前还没有求解TSP问题的比较有效的实时算法。
The question of unmanned spy plane's cruise is TSP problem, regardless of other constraints.
无人侦察机的巡航问题，如果不考虑其它约束条件，实际上是一个TSP问题。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
Based on the immune principles, this paper at first analyse the immune algorithm by solving TSP problem which improves the ability of population and increase the holistic performance.
本文利用免疫的有关概念和理论，先对免疫算法性能做分析，设计一个免疫算法求解tsp问题，验证基于免疫的算法有利于整体的相对稳定和性能的提高。
In this paper, a method is proposed that combines the strategy of problem reduction with case-based reasoning to give necessary flexibility to TSP.
文中提出用问题归约策略与基于范例推理结合的方法解决这个问题。
Therefore propose an effective solution to the problem of the TSP algorithms have a higher theoretical and practical value.
因此提出一种有效地解决TSP问题的算法有着较高的理论意义和实际应用价值。
This article discusses the computational complexity of Traveling Salesman Problem, and points out the difference of computational complexity between Decisive TSP and Optimal TSP.
讨论了货郎问题的计算复杂性，指出了货郎优化问题与货郎判定问题计算复杂性的差异。
GENIUS algorithm is used to solve TSP problem in this algorithm. Through this processing, not only better solution can be got, but also the likelihood of local optimal be reduced by perturbing sol...
采用GENIUS算法处理其中的TSP问题，不仅能产生较好的解，而且通过对解的周期性的扰动，进一步减少求解陷于局部优化的可能性。
In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
Firstly, the scale of the problem is a very important factor for solving the TSP, time complexity of Algorithms grows exponentially with the scale.
首先，问题的规模对于TSP问题的求解来说是一个很重要的因素，其时间复杂度将随着问题规模呈指数形式增长。
Finally, the analysis and study of TSP-203 in the prediction and interpretation of the geological problems encountered during the proposed solution to the problem.
最后，分析和研究TSP- 203在地质预报和解译过程中遇到的问题，提出解决问题的方法。
This chaotic neural network is used to the 10-city traveling salesman problem (TSP), and the influence of trigonometric function self-feedback on TSP is analyzed.
混沌神经网络的10个城市的旅行商问题（TSP），和三角函数自反馈对TSP的影响进行了分析。
Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48. TXT) to calculate the optimal solution of the path and road map are as follows.
程序对48个城市的TSP问题(城市坐标文件对应于48. txt)进行计算，求解路径和最优路径图如下。
Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48. TXT) to calculate the optimal solution of the path and road map are as follows.
程序对48个城市的TSP问题(城市坐标文件对应于48. txt)进行计算，求解路径和最优路径图如下。
应用推荐