Traveling salesman problem ( TSP ) a typical NP complete combinatorial optimum problem.

旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

互联网

Traveling salesman problem ( TSP ) is a typical NP complete combinatorial optimum problem.

摘要旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

互联网

The paper researched the method to solve TSP with constrains by genetic algorithm.

主要研究用遗传算法解决带有约束的TSP的方法.

互联网

Consequence: we saw that the CD 42 a , TSP and CD 9 expression adqulis on cell surface by confocal microscopy.

结果: 利用激光扫描可见CD9、CD42a、TSP均匀的表达了细胞表面.

互联网

Porting some standard parallel program form Unix platform, such as Barnes, TSP, LU, etc.

·从Unix平台上移植了一批标准并行计算程序, 例如Barnes, TSP, Water,EP, LU等 .

互联网

The experiment for TSP shows that the improved algorithm can obtain better efficiency and general optimization.

TSP的数值实验表明了改进算法的可行性及更好的全局优化性.

互联网

Ant Algorithm VB source code to solve the TSP process, a number of TSP answer!

蚁群算法VB源代码,解决TSP问题的程序, 有多种TSP问题解答!

互联网

A chaos optimization method is proposed for TSP.

针对tsp问题,提出了一种用于解决组合优化问题的混沌优化算法.

互联网

In this paper, a good - point set genetic algorithm is applied to the TSP problem.

文章针对求解货郎担问题(TSP), 给出了一种佳点集遗传算法.

互联网

Genetic algorithm written in C #. It can be used to solve TSP, Time non - convex programming problems.

运用c # 语言实现模拟退火算法, 同时利用该算法解决旅行商(TSP)问题,获得遍历所有城市序号的最优路径.

互联网

This article proposes a modified algorithm for solving the travelling salesman problem ( TSP ) by neural network.

本文提出用神经网络解旅行商问题 ( TSP ) 的改进算法.

互联网

This paper deals with TSP by transform TSP to a special Shortest Path Problem.

本文将解决TSP问题转化为一种特殊的最短路问题.

互联网

Traveling Salesman Problem, or TSP problem ( Travelling Salesman Problem ) is a well - known field of mathematics problems.

旅行商问题, 即TSP问题 ( TravellingSalesmanProblem ) 是数学领域中著名问题之一.

互联网

Comparison with traditional method auto waves method can always find the optimal answer to the TSP.

与传统的TSP问题求解方法相比,本文方法所找到的是TSP问题的最优解.

互联网

Particle Swarm Optimization ( PSO ) for the TSP complete source code, has been tested.

粒子群优化 ( PSO ) 的完整的TSP的源代码, 已经过测试.

互联网