Fuzzy shortest paths
β Scribed by Cerry M. Klein
- Book ID
- 104169430
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 747 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op
This paper deals with a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. Such a problem is "ill-posed" because each arc cannot be identiΓΏed as being either on the shortest path or not. Therefore, based on the possibility theory, we
This paper concentrates on a shortest path problem on a network where arc lengths (costs) are not deterministic numbers, but imprecise ones. Here, costs of the shortest path problem are fuzzy intervals with increasing membership functions, whereas the membership function of the total cost of the sho