您要查找的是不是：
- Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. 段海滨;王道波.;一种快速全局优化的改进蚁群算法及仿真[J]
- 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. 以旅行商问题为例进行仿真实验,结果表明该算法比其他同类算法具有更好的性能。
- Dorigo, M. and L. M. Gambardella, “Ant colony system: A cooperative learning approach to the traveling salesman problem”, IEEE Transaction on Evolutionary Computation, Vol.1,No1. pp 53-66, 1997. 蔡聪男，自适应式表面黏著制程品质预测控制系统之发展，成功大学制造工程研究所博士班，博士论文，民国92年。
- The Traveling Salesman Problem (TSP) is a typical optimization problem, which belongs to a large family of problems classified as NP-complete. It has the important project background. 旅行商问题(TSP)是一个有着重要工程背景、在图论中的典型组合优化问题，已被证实是一个NP完全问题。
- In this thesis we present several hybrid particle swarm optimization algorithms to solve the traveling salesman problem, the flow-shop scheduling problem and the forecasting problems respectively. 在本论文中我们发展了数种混合式粒子群最佳化演算法来解决旅行推销员问题，流水型工厂排程问题，以及预测问题。
- This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network. 本文提出用神经网络解旅行商问题(TSP)的改进算法。
- By use of the properties of pheromone of ant colony algorithm, an ant colony algorithm based on multiplicate pheromone is proposed to solve the traveling salesman problems(TSP). 根据蚁群算法信息素更新的特性,提出了求解旅行商问题的多样信息素的蚁群算法。
- Abstract： Bettering path is actually a problem of seeking an approximition algorithm for the travelling salesman problem. 摘 要： 较佳路径[1]的求解问题事实上是货郎担近似算法的问题。
- By use of the properties of pheromone of ant colony algorithm,an ant colony algorithm based on multiplicate pheromone declining is proposed to solve the Traveling Salesman Problems（TSP）. 摘要 根据蚁群算法信息素更新的特性,提出了求解旅行商问题的混合信息素递减的蚁群算法。
- SIZESCALE: NEW ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM SizeScale:求解旅行商问题(tsp)的新算法
- SYNTHETIC PERFORMANCE OF MAIN ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM 旅行商问题典型算法的综合性能
- On the Solution of the Traveling Salesman Problem with Simulated Annealing 用模拟退火算法求解旅行商问题
- Resolution of the Traveling Salesman Problem with Precedence Constraint Applying Genetic Algorithm 运用遗传算法求解有约束条件的旅行商问题
- 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完全组合优化问题。
- Traveling Salesman Problem (TSP) is a classic combinatorial optimizes issue and an NP-hard. 旅行商问题是一个经典的组合优化问题，也是一个NP难题。
- the traveling salesman problem 旅行商问题
- Clerc M. Discrete Swarm Optimizition Illustratedbythe Traveling Salesman Problem [DB/OL]. http://www. mauriceclerc.net, 2000. 曾剑潮;崔志华.;微粒群算法[M]
- 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)算法。
