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.
旅行推销员问题是一个最受人喜爱的数学难题:如果一个推销员不得不访问几个城市,怎样走最短的路线使他一次到达这几个城市。
Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
Second, we apply all of them to 10-city travelling salesman problem (TSP), respectively.
其次将四种方法分别应用于10个城市的旅行推销商问题。
It has been paid much attention to since the successful application in the famous traveling salesman problem.
自从在旅行商等著名问题中得到富有成效的应用之后,已引起人们越来越多的关注和重视。
This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network.
本文提出用神经网络解旅行商问题(tsp)的改进算法。
Traveling salesman problem(TSP) and nonlinear equations are two kinds of important problems with widely applications.
旅行商问题(TSP)和非线性方程组都是具有广泛的应用背景的重要问题。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数,遗传算法(GA)可以有效求解旅行商问题(tsp)。
Experimental results on traveling salesman problem show that proposed algorithm has a good global searching ability and high convergence speed.
基于旅行商问题的实验证明,算法具有较好的全局搜索能力和收敛速度。
The paper has used the improved algorithm and has been proved by travelling salesman problem of solving the problems of CHN31, ATT48 and EIL51.
本文运用了新改进的算法,通过旅行商问题来进行验证,分别对其中的CHN31、ATT48和EIL51进行求解。
The paper discusses the operational characteristics of warehouse and gives a common order picking optimal algorithm for travel salesman problem.
分析了自动化仓库堆垛机拣选作业的运行特点,给出了堆垛机拣选作业旅行商数学模型的常用优化算法。
By using LCA to solve traveling salesman problem, satisfactory results are obtained. Examples show that LCA has good global search characteristic.
用列队竞争算法解旅行商问题获得了满意的结果,显示出列队竞争算法良好的全局搜索性能。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题,概述了ACO在静态组合最优化和动态组合优化问题中的应用。
Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
摘要:旅行商问题是一个学术界广泛研究的问题,长期以来许多的学者潜心研究,有了可观的成果。
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.
采用随机三角点阵上城市间的最近邻关系,构造路径子空间来求解旅行推销员问题。
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 contrasting experiments on the typical traveling salesman problem (TSP) show that the proposed algorithm is better than standard ant colony system in speed and accuracy.
针对典型的旅行商问题(TSP)进行对比实验,验证了所提出的算法在速度和精度方面优于传统的蚁群系统。
This paper offers an exact algorithm for the classic travelling salesman problem, the computational results show that it has some obvious advantages and practical applications.
本文对经典的旅行商问题给出一种精确式算法,计算结果表明,它具有一定的优越性和实用性。
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.
为了解决最小化旅行时间的多旅行商一类问题,提出了一种递阶遗传算法和矩阵解码方法。
Tool-path airtime optimization during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm was proposed.
将皮革裁剪多轮廓加工空行程路径优化问题归结为广义旅行商问题,提出了一种求解问题的混合智能优化算法。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题,根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
RLTSP is quite close to the traveling-salesman problem in real life, and it is between the traditional traveling-salesman problem (TSP) and the graphical traveling-salesman problem (GTSP).
它更接近于现实生活中的旅行商问题,并且介于传统的旅行商问题(TSP)与图形旅行商问题(GTSP)之间。
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问题中显示了巨大的优势。
In this way, they effectively solved the "traveling salesman problem," which involves finding the shortest route that allows a traveling salesman to call at all the locations he has to visit.
这样,它们有效地解决了“旅行推销员问题”,即如果一个旅行推销员需访问多个地点,如何找到访问这些地点的最短路线。
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.
提出了邮包自动化仓库在线调度的概念和方法,即动态调度问题,实际上等同于解决在线旅行商问题。
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 problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
Traveling Salesman problem (TSP) is a classic combinatorial optimization problem and NP-hard.
旅行商问题是一个经典的组合优化问题,也是一个NP难问题。
Traveling Salesman problem (TSP) is a classic combinatorial optimization problem and NP-hard.
旅行商问题是一个经典的组合优化问题,也是一个NP难问题。
应用推荐