The shortest path problem with discrete fuzzy arc lengths
β Scribed by Jung-Yuan Kung; Tzung-Nan Chuang
- Book ID
- 108076930
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 482 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We concentrate on a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. Introducing an order relation between fuzzy numbers based on "fuzzy min", a nondominated path or Pareto Optimal path from the speciΓΏed node to every other node is
## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr
## a b s t r a c t We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using Ξ±-cuts by proposing a linear least squar