一种非完全图最短遍历路径的新型求解方法

A New Method for Solving the Shortest Traveling Path of Non - perfect Graph

本文提出一种通过非完全图虚拟化完全图，并利用遗传算法求解虚拟完全图的最短 遍历路径，最终解决非完全国最短遍历路径问题的新方法，实验证明：该方法能有效 求解非完全图最短遍历路径问题，为工程应用提供了一种强有力的数学工具。

Virtual perfect graph and the method to convert the non - perfect graph into virtual perfect graph are given in this paper. Converted into virtual perfect graph, the shortest traveling path of a non-perfect graph is drastically solved with Genetic Algorithm to search the shortest traveling path. The simulation shows that the method is feasible and provides a powerful method for engineering application.