Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).
具有瞬态混沌特性的神经网络(TCNN)可以解tsp。
This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem.
本文提出了一些对遗传算法应用于旅行商问题的方法。
The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.
货郎担问题是组合优化中的著名问题，到目前为止它还没有一个有效算法。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数，遗传算法(GA)可以有效求解旅行商问题(tsp)。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。
The Film Deliverer problem (FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman problem (TSP).
影片递送问题(简称FDP)是组合优化的一个新问题，它比旅行商问题(简称TSP)复杂得多。
In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.
基于贪心算法提出了一种改进的求解旅行商问题(tsp)的拟人算法。
The problem in Chow expect travel around, every city is accessed once and only once, we take into account the solution to the traveling salesman problem.
本题中周先生想到各地旅游，每个城市都被访问一次且仅一次，我们考虑到了旅行商问题的解决方法。
In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues.
本软件除了用于教学目的外，还可用于解决实际生活中的与TSP(即，旅行商问题)问题相关的问题。
The nearest neighbour relation between cities on random triangle lattice has been used to construct a tour subspace and to solve the traveling salesman problem.
采用随机三角点阵上城市间的最近邻关系，构造路径子空间来求解旅行推销员问题。
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.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
On this basis, we proposed a two-step solution of the traveling salesman problem, a large number of simulation experiments show that the algorithm has produced good results.
在此基础上，我们又提出了解决旅行商问题的两步法，大量的仿真实验表明这一算法取得了良好的效果。
The Film Copy Deliverer Problem is the extension of the Traveling Salesman Problem and the Multiple Traveling Salesman Problem, and it is significance in theory and practice.
影片递送问题是旅行商问题和多路旅行商问题的扩展，具有重要的理论和实际意义。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
The evolutionary algorithm using inver-over operator for the traveling salesman problem(TSP) has great ascendancy, because its ability in global searching for optimal individual is powerful.
使用逆转算子求解TSP的演化算法具有很强全局搜索能力，在求解TSP问题中显示了巨大的优势。
Enlighted by the mutual contacts between the nature species groups, the paper proposes the inter-group competition and collaboration of genetic algorithms to solve the traveling salesman problem.
受自然界物种群体间相互联系的启发，提出了群体间竞争与协作的遗传算法来解决旅行商问题。
The conception and method of online scheduling in parcel post automated warehouse are put forward, that is dynamic scheduling problem, which is equal to solve online traveling salesman problem.
提出了邮包自动化仓库在线调度的概念和方法，即动态调度问题，实际上等同于解决在线旅行商问题。
Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
摘要：旅行商问题是一个学术界广泛研究的问题，长期以来许多的学者潜心研究，有了可观的成果。
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问题。
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
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 applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
Based on analyzing the encoding characteristics of POCSAG carefully, the Problem can he abstracted as a special Traveling Salesman Problem, soa mathematical model of optimization encoding is set up.
经过对POCSAG码编码特性的分析，这一问题可以抽象为一个特殊的旅行商问题，从而得出优化编码的数学模型。
It has been paid much attention to since the successful application in the famous traveling salesman problem.
自从在旅行商等著名问题中得到富有成效的应用之后，已引起人们越来越多的关注和重视。
In testing the effectiveness of the proposed method, the quantum algorithm for combinatorial optimization both for function optimization problem or a traveling salesman, had achieved good results.
在对所提算法有效性的测试中，量子组合优化算法无论对函数优化还是旅行商问题，都取得了较好的效果。
In testing the effectiveness of the proposed method, the quantum algorithm for combinatorial optimization both for function optimization problem or a traveling salesman, had achieved good results.
在对所提算法有效性的测试中，量子组合优化算法无论对函数优化还是旅行商问题，都取得了较好的效果。
应用推荐