| 模糊最短路的一种算法 |
| |
| 引用本文： | 李引珍. 模糊最短路的一种算法[J]. 运筹与管理, 2004, 13(5): 7-11 |
| |
| 作者姓名： | 李引珍 |
| |
| 作者单位： | 兰州交通大学,甘肃,兰州,730070;西南交通大学,四川,成都,610031 |
| |
| 基金项目： | 国家自然科学基金资助项目(70071028),兰州交通大学"青蓝工程"资助 |
| |
| 摘 要： | 模糊最短路问题在许多领域有着广泛的应用,研究这一问题具有重要意义。根据多准则决策理论求非被支配路径集合,求最大效用模糊最短路以及利用模糊数排序方法求模糊最短路是常用的三种研究方法,本文利用OERI排序原理,使网络模糊边长具有线性可加性,对具有三角模糊数边权的网络给出了一种标号算法,该算法简单高效,且易于在计算机上实现,算法的时间复杂度为O(n^2)。
|
| 关 键 词： | 运筹学 网络 最短路 模糊数排序 标号算法 |
| 文章编号： | 1007-3221(2004)05-0007-05 |
An Algorithm for Finding Fuzzy Shortest Path |
| |
| Li Yin-zhen. An Algorithm for Finding Fuzzy Shortest Path[J]. Operations Research and Management Science, 2004, 13(5): 7-11 |
| |
| Authors: | Li Yin-zhen |
| |
| Affiliation: | Li Yin-zhen~ |
| |
| Abstract: | The fuzzy shortest path problem on a network appears in many applications. It is significant to research into it. Finding a set of non-dominated fuzzy shortest paths according to multi-criteria decision theory, fuzzy shortest paths based on maximum utility, and fuzzy shortest paths by using methods of fuzzy numbers ranking are three research methods widely adopted. Based on the principle of OREI, fuzzy lengths of edges on a network are linear addible. Then an algorithm for finding fuzzy shortest path on a network with triangular fuzzy arc lengths is presented in this paper. The algorithm is simple, efficient and easy to implement on a computer. The time complexity is O(n~2). |
| |
| Keywords: | operations research network shortest path fuzzy numbers ranking labeling algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
