The experiment for TSP shows that the improved algorithm can obtain better efficiency and general optimization.
TSP的数值实验表明了改进算法的可行性及更好的全局优化性。
The evolutionary algorithm using inver-over operator for the traveling salesman problem(TSP) has great ascendancy, because its ability in global searching for optimal individual is powerful.
使用逆转算子求解TSP的演化算法具有很强全局搜索能力，在求解TSP问题中显示了巨大的优势。
The ant colony system is introduced and a new algorithm for TSP is presented. This algorithm is a distributed parallel algorithm with a new state transition rule and new global updating rule.
从介绍蚂蚁系统出发，提出了新的状态转移规则及全局修正规则，结合这些新规则设计出一个新算法，该算法是一个分布式并行算法。
This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network.
本文提出用神经网络解旅行商问题(tsp)的改进算法。
An evolutionary algorithm based on multi-player game theory(EAMG) for the TSP was proposed.
提出了一种基于多人博弈的演化优化方法（EAMG），用于解决旅行商问题（TSP）。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
The paper proposes a dynamic grouping algorithm for TSP.
利用TSP问题特点，提出了动态分组算法求TSP问题。
In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.
基于贪心算法提出了一种改进的求解旅行商问题(tsp)的拟人算法。
In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.
基于贪心算法提出了一种改进的求解旅行商问题(tsp)的拟人算法。
应用推荐