This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem(TSP). 本文提出了一些对遗传算法应用于旅行商问题的方法。
Their 33-city task is an instance of the traveling salesman problem, or TSP for short. 他们在33个城市的任务就是推销商旅行问题的一个例子,或简称为tsp。
The modified elastic net algorithm for finding solutions to the traveling salesman problem ( TSP ) is introduced. 通过对弹性神经网络进行分析,给出了求解TSP问题的一个改进的弹性网络算法。
The simulation to traveling salesman problem proves that the algorithm can rapidly get the best or second best solution. 应用该算法求解旅行商问题的仿真实验证明了它能较快地收敛到最优解或准最优解。
Steady Niche Genetic Algorithm ( SNGA ) is presented for solving the China Traveling Salesman Problem(TSP). 提出了一种求解中国旅行商问题(CTSP)的稳态小生境遗传算法SNGA。