Loading...

A shortest path algorithm for a network with various fuzzy arc lengths

Tajdin, A ; Sharif University of Technology | 2010

360 Viewed
  1. Type of Document: Article
  2. DOI: 10.1063/1.3459759
  3. Publisher: 2010
  4. Abstract:
  5. 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. Then, we propose a regression model for obtaining membership function for the considered addition. Finally, we present a dynamic programming method for finding a shortest path in the network. An example is worked out to illustrate the applicability of the proposed approach
  6. Keywords:
  7. A-cut ; Dynamic programming ; Fuzzy numbers ; Regression model ; Shortest path
  8. Source: AIP Conference Proceedings, 2 February 2010 through 4 February 2010, Gold Coast, QLD ; Volume 1239 , 2010 , Pages 260-267 ; 0094243X (ISSN) ; 9780735407855 (ISBN)
  9. URL: http://aip.scitation.org/doi/abs/10.1063/1.3459759