Fuzzy shortest path problem with finite fuzzy quantities

Research output: Contribution to conferencePaperpeer-review

Abstract

We discuss the problem of finding the shortest paths from a fixed origin to all nodes on a network not necessarily acyclic, with each arc length represented as positive fuzzy quantity with finite support. At first we show that the only existing paper on this problem, Klein's algorithm, in some cases will lead to a dominated path in the sense of extension principle and then we introduce a new algorithm for the problem. The proposed algorithm is on the basis of the multiple labeling method of Hansen and Dijkstra's shortest path algorithm.

Original languageEnglish
Pages664-669
Number of pages6
DOIs
StatePublished - 2005
EventNAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society - Detroit, MI, United States
Duration: 26 Jun 200528 Jun 2005

Conference

ConferenceNAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society
Country/TerritoryUnited States
CityDetroit, MI
Period26/06/0528/06/05

Keywords

  • Fuzzy network
  • Fuzzy quantity
  • Shortest path

Fingerprint

Dive into the research topics of 'Fuzzy shortest path problem with finite fuzzy quantities'. Together they form a unique fingerprint.

Cite this