The fuzzy shortest path length and the corresponding shortest path in a network |
| |
| Affiliation: | 1. Department of Merchant Marine, National Taiwan Ocean University, Keelung 20224, Taiwan;2. Department of Information Management, Chinese Naval Academy, Kaohsiung, 81342, Taiwan;1. Department of Computer and Information Science, Keio University, Yokohama, Kanagawa, Japan;2. Faculty of Science and Technology, Keio University, 3-14-1 Hiyoshi, Yokohama 223-8522, Japan;1. Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland;2. Institute of Mathematics and Computer Science, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland;1. College of Science, Liaoning University of Technology, Jinzhou 121000, China;2. State Key Laboratory of Molecular Reaction Dynamics, Dalian Institute of Chemical Physics Chinese Academy of Sciences, Dalian 116023, China;3. School of Chemical and Environmental Engineering, Liaoning University of Technology, Jinzhou 121000, China |
| |
| Abstract: | The fuzzy shortest path (SP) problem aims at providing decision makers with the fuzzy shortest path length (FSPL) and the SP in a network with fuzzy arc lengths. In this paper, each arc length is represented as a triangular fuzzy set and a new algorithm is proposed to deal with the fuzzy SP problem. First, we proposed a heuristic procedure to find the FSPL among all possible paths in a network. It is based on the idea that a crisp number is a minimum number if and only if any other number is larger than or equal to it. It owns a firm theoretic base in fuzzy sets theory and can be implemented effectively. Second, we propose a way to measure the similarity degree between the FSPL and each fuzzy path lengths. The path with the highest similarity degree is the SP. An illustrative example is given to demonstrate our proposed approach. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
