论文部分内容阅读
本文提出一种通过非完全图虚拟化完全图,并利用遗传算法求解虚拟完全图的最短 遍历路径,最终解决非完全国最短遍历路径问题的新方法,实验证明:该方法能有效 求解非完全图最短遍历路径问题,为工程应用提供了一种强有力的数学工具。
In this paper, we present a new method to solve the shortest traversal path of non-complete country by virtual graph of incomplete graph and genetic algorithm to solve the shortest traversal path of virtual complete graph. Experiments show that this method can solve non-complete graph effectively The shortest path traversal problem provides a powerful mathematical tool for engineering application.