您要查找的是不是：
- Traveling salesman problem belongs to NP complete. Now it has not found the effective solution yet. 旅行商问题属于np问题，现在还没有找到有效的解法。
- Traveling salesman problem (TSP) is a typical NP complete combinatorial optimum problem. 摘要旅行商问题(TSP)是典型的NP完全组合优化问题。
- Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. 段海滨;王道波.;一种快速全局优化的改进蚁群算法及仿真[J]
- Traveling Salesman Problem (TSP) is a classic combinatorial optimizes issue and an NP-hard. 旅行商问题是一个经典的组合优化问题，也是一个NP难题。
- Clerc M. Discrete Swarm Optimizition Illustratedbythe Traveling Salesman Problem [DB/OL]. http://www. mauriceclerc.net, 2000. 曾剑潮;崔志华.;微粒群算法[M]
- This method is then applied in the traveling salesman problem, and the results show that this method leads to significant improvement over the traditional subgradient algorithm. 最后通过仿真实验验证了该方法的有效性。
- Simulation results for solving the Traveling Salesman Problem(TSP)show that ACAHM is superior to other congeneric algorithms in terms of solution quality and computation speed. 以旅行商问题为例进行仿真实验,结果表明该算法比其他同类算法具有更好的性能。
- By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization (CACO) algorithm is proposed to solve traveling salesman problem. 摘要利用混沌运动的遍历性、随机性和规律性等特点，提出了一种求解旅行商问题的混沌蚁群(CACO)算法。
- This paper presents a new kind of traveling salesman problem which is called course traveling salesman problem, and gives an improved edge-searching-based ACO. 定义了一种新的旅行商问题，即过程旅行商问题，针对这个问题提出了一种基于边缘搜索的改进蚁群算法。
- Circle permutation problem is translated into traveling salesman problem (TSP) firstly, then the simulated annealing algorithm (SA) is used to solve the TSP. 摘要首先把圆排列问题转化为旅行商问题，然后利用模拟退火算法求解此问题。
- The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed. 结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题;概述了ACO在静态组合最优化和动态组合优化问题中的应用.
- It is a retrospective method used to solve TSP practical cases, this case can be an effective home sleep travel salesman problem (traveling salesman problem). 这是一个关于用回溯法解决TSP问题的实际案例，此案例可以有效的家觉旅行售货员问题（货郎担问题）。
- The solving TSP( Traveling Salesman Problem) examples as benchmark shows that this platform can increase the branch and bound algorithm's efficiency and get the optimal solution sooner. 计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。
- The Chinese Traveling Salesman Problem(CTSP)is one of combinatorial optimization problems, and is a NP. 中国旅行商问题是一个组合优化问题,是一个NP问题。
- The common Traveling Salesman Problem(TSP) is static,but in actual life,most optimal problems are dynamic. 传统的旅行商问题都是静态的,但在现实中许多问题是动态的。
- In this paper traveling salesman problem is introduced. A new genetic algorithm to solve traveling salesman problem is proposed. The experiment shows that this algorithm is efficient. 介绍了旅行商问题;提出厂一个新的求解旅行商问题的遗传算法;实验结果显示该算法性能良好.
- As one of the latter algorithms, ant colony algorithm has been used to many fields, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Network Routing and Load-Balancing Problem, VLSI Design, etc. 摘要蚁群算法作为一种较新的进化类方法，目前已经在若干领域取得了成功的应用，诸如：旅行商问题、二次分配问题、通讯网络中的路由问题以及负载平衡问题、大规模集成电路设计等。
- Aarts, E.H.L. and Korst, J., “Boltzmann Machines for Traveling Salesman Problems”, European Journal of Operations Research, Vol.39, pp.79-95, 1989. 苏鸿润;“模拟退火法之参数选择”;国立台湾工业技术学院机械工程技术研究所硕士学位论文;民国八十六年六月.
- A new Heuristic Genetic Information based Ant Colony Genetic Algorithm (HGI-ACGA) to solve Traveling Salesman Problems(TSP) was proposed. 结合遗传算法和蚁群算法，提出了一种求解TSP的基于启发式遗传信息的蚁群遗传算法。
- The sequencing problem is modeled as a cumulative traveling salesman problem (TSP) with ready time, static and dynamic, two cases, are considered, and a set of constraints are adde. 提出了一种新的终端区规划排序模型,把飞机的排序问题看作等价于带有准备好时间的渐增周游店员问题,并给出了兼顾解的最优性和计算复杂性的快速启发式算法。
