CAJ | 학술논문

为满意地解决多目标最短路径问题，提出基于循环搜索第k短路径，构造新集合做交集的多项式算法。该算法是在每一轮的k短路搜索完以后，通过交集产生多目标最短路径或备选路径。当有多条备选路径时再用Vague集投影和距离的决策方法，根据评价值的大小对候选方案进行排序，从而选取最佳方案。
위만의지해결다목표최단로경문제，제출기우순배수색제k단로경，구조신집합주교집적다항식산법。해산법시재매일륜적k단로수색완이후，통과교집산생다목표최단로경혹비선로경。당유다조비선로경시재용Vague집투영화거리적결책방법，근거평개치적대소대후선방안진행배서，종이선취최가방안。
To obtain a multi-objective shortest path, which may meet the decision-maker＇s requirements, this paper presents the basis of syclic research k shortest path and constructs a polynomial algorithm to intersect the new set. After every round of the k shortest path marching, the algorithm preduces a multiobjective shortest path or alternative path by the intersection. When a number of alternative paths are available, the method of projection of Vague set and distance is used. The optional schemes are sequenced according to the evaluation size, thus the best optimal solution may be obtained.