您要查找的是不是：
- This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network. 本文提出用神经网络解旅行商问题(TSP)的改进算法。
- Abstract： Bettering path is actually a problem of seeking an approximition algorithm for the travelling salesman problem. 摘 要： 较佳路径[1]的求解问题事实上是货郎担近似算法的问题。
- When the method of antibody distilling and injecting used in Travelling Salesman Problem (TSP) were presented, the convergence of AIGA was proven theoretically. 结合旅行商问题(TSP)，给出了示范抗体的提取和注射方法，并给出了算法收敛性的理论证明。
- Aimed at many fields' combinational optimization problems being transformed into travelling salesman problem (TSP), a complex particle swarm optimization (CPSO) algorithm was put forward to solve TSP. 摘要针对众多领域的组合优化问题可转化为旅行商问题(TSP)，提出求解TSP的粒子群复形(CPSO)算法。
- travelling salesman problem(TSP) 旅行商问题
- bi-objective travelling salesman problem 双目标旅行商问题
- Travelling Salesman Problem (TSP) TSP
- 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问题的实际案例，此案例可以有效的家觉旅行售货员问题（货郎担问题）。
- plane travelling salesman problem 平面旅行商问题
- 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在静态组合最优化和动态组合优化问题中的应用.
