A new dynamic programming approach for finding the shortest path length and the corresponding shortest path in a discrete fuzzy network

  • Authors:

  • Jung-Yuan Kung;Tzung-Nan Chuang;Chia-Tzu Lin

  • Affiliations:

  • Department of Information Management, Chinese Naval Academy, No. 669, Chun Hsiao Rd., Tsoying, Kaohsiung 81342, Taiwan;Department of Merchant Marine, National Taiwan Ocean University, No. 2, Pei Ning Rd., Keelung 20224, Taiwan;(Correspd. Tel.: +886 6 5977000/ Fax: +886 6 5977600/ E-mail: lin.chiatzu@msa.hinet.net) Department of Information Management, Far East College, No. 49, Chung Hua Rd., Hsin-Shih, Tainan 744, Taiwa ...

  • Venue:
  • Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerous articles have focused on the fuzzy shortest path problem in a network since it is central to various applications. It purposes to provide a decision maker with the shortest path length and the shortest path in a fuzzy network. In this paper, we propose a dynamic programming approach for fuzzy shortest path problem in a network where each arc length is represented as a discrete fuzzy set. This approach can be used to treat discrete fuzzy shortest path problem without some shortcomings existing in other related researches. A classic example is also included to demonstrate our proposed approach.