基于k短路径算法的多目标最短路径算法  

Algorithm for Shortest Path of Multi-objectives Based on k Short Parth Algorithm

作　　者：康太平[1] 张晓刚[1] 王宗峰[1] 何尚录[1] 

机构地区：[1]兰州交通大学数理与软件工程学院,甘肃兰州730070

出　　处：《常州工学院学报》2011年第3期25-27,33,共4页Journal of Changzhou Institute of Technology

摘　　要：为满意地解决多目标最短路径问题,提出基于循环搜索第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.

关 键 词：多目标 第k短路径 VAGUE集 

分 类 号：O122.6[理学—数学]