%0 Journal Article
%T 基于支持向量机的改进遗传算法在模糊最短路问题中的应用<br>The Application of Improved Genetic Algorithm Based on Support Vector Machine in Fuzzy Shortest Path Problem
%A 孙亚莉
%A 陈学刚
%A 陈甜甜
%J Computer Science and Application
%P 2496-2505
%@ 2161-881X
%D 2021
%I Hans Publishing
%R 10.12677/CSA.2021.1110253
%X <div style=\"text-align:justify;\">
	<span style=\"font-size:14px;\">最短路问题是图论中重要的优化问题之一。随着网络的增大，求最短路径的时间复杂度越来越大。本文基于模糊图中部分路径的长度，设计了基于支持向量机的改进遗传算法，并用该算法求得了模糊最短路问题的较好近似解。最后通过数值算例模拟该算法，并与标准的遗传算法作对比，结果表明该算法是有效的。<br />
The shortest path problem is one of the important optimization problems in graph theory. As the network grows, the time complexity of finding the shortest path is getting bigger and bigger. Based on the length of some paths in the fuzzy graph, this paper designs an improved genetic algorithm based on support vector machines, and uses this algorithm to obtain a better approximate solution to the fuzzy shortest path problem. Finally, the algorithm is simulated through a numerical calculation example and compared with the standard genetic algorithm. The result shows that the algorithm is effective.</span> 
</div>
%K 遗传算法，模糊最短路问题，支持向量机，适应度值<br>Genetic Algorithm
%K Fuzzy Shortest Path Problem
%K Support Vector Machine
%K Fitness Value
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=45732