Traveling Salesman Problem

Solving Traveling Salesman Problem by Ant Colony Optimization Genetic Hybrid Algorithm

求解旅行商问题的蚁群遗传混合算法

Analysis and Application of Candidate Sets of Traveling Salesman Problem

TSP问题启发集的分析及应用

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

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

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

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

Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem

一类多旅行商问题的计算及仿真分析

A new improved discrete particle swarm optimization algorithm is designed to tackle the Traveling Salesman Problem.

借鉴蚁群算法的信息素机制,提出了一种基于信息素机制的离散粒子群算法.

The last step of the translation is searching the best sequence of the translated phrases by solving the Traveling salesman problem with Held& Karp DP algorithm.

翻译的最后一步是利用动态规划算法来求解TSP问题最优路径的方式搜索最优的译文顺序。

A Kind of New Algorithm to Solve the Multi-objective Traveling Salesman Problem

求解一个多旅行商问题的一种新近似算法

Study on a New Heuristic Crossover for the Traveling Salesman Problem

一种求解旅行商问题的启发交叉算子的研究

A Hybrid Genetic Algorithm based on Uniform Design Sampling for Solving Traveling Salesman Problem Using

一种求解TSP问题的均匀设计抽样混合遗传算法

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

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

This chaotic neural network is used to the10-city traveling salesman problem ( TSP), and the influence of trigonometric function self-feedback on TSP is analyzed.

将该网络模型应用于求解10城市旅行商问题（TSP），分析了三角函数自反馈对网络求解旅行商问题的影响。

Genetic algorithm for a special pickup and delivery traveling salesman problem

一类特殊的集送一体化TSP问题及其遗传算法求解

DNA Algorithm for Traveling Salesman Problem Based on Molecular Computation

旅行售货员问题的DNA分子算法

Solving Traveling Salesman Problem by the Adaptive Genetic Algorithm Based on the Regional Search

利用基于分区搜索的自适应遗传算法求解TSP问题

Research on Mixed Genetic Algorithms Based On Traveling Salesman Problem

基于TSP问题的混合遗传算法研究

Traveling Salesman Problem is NP-hard problem which the solution quantity will increase exponentially with the number of cities. The stacker running path is the same.

将堆垛机拣选作业路径优化问题近似旅行商问题来求解，求解旅行商问题属于NP难题，其解的数量会随着城市数量成指数增长，堆垛机运行的路径也是如此。

A Study on the Computational Complexity of Traveling Salesman Problem

对货郎问题计算复杂性的研究

Four algorithms of traveling salesman problem ( i.e. TSP) solving are introduced, including: greedy algorithm? MST approximation algorithm? MM approximation algorithm and backtracking search algorithm.

介绍了求解货郎问题的4个算法：贪心算法、MST近似算法、MM近似算法和回溯搜索算法。

A New DNA Encoding Method for the Traveling Salesman Problem

旅行商问题的一种新DNA编码方案

A Filled Function Method for the Traveling Salesman Problem

一个基于填充函数变换的对称TSP问题的局部搜索算法

In this paper, a personification algorithm for solving the Traveling Salesman Problem ( TSP) is proposed, which is based on original greedy algorithm.

基于贪心算法提出了一种改进的求解旅行商问题（TSP）的拟人算法。

A Parallel Algorithm for the Simulated Annealing Based Traveling Salesman Problem

基于模拟退火算法旅行商问题的并行实现

We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.

通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。

Hybrid Approach Based on Ant Algorithm for Solving Traveling Salesman Problem

基于蚂蚁算法的混合方法求解旅行商问题

Design and Implementation for Searching Feasible Solutions of Traveling Salesman Problem

旅行商问题的较优可行解的搜索算法的设计

Application study on hybrid quantum algorithm in traveling salesman problem

混合量子算法在旅行商问题中的应用研究

Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm

基于递阶遗传算法的一类多旅行商问题优化

The traveling salesman problem is a typical NP problem.

旅行商问题是一个典型的NP完全性问题。

Optimal Clumping Principle and Clumping Method to Solve Traveling Salesman Problem

最优聚丛原理与聚丛法求解旅行商问题