Loading...

Designing a new algorithm for the fuzzy shortest path problem in a network

Mahdavi, I ; Sharif University of Technology | 2007

230 Viewed
  1. Type of Document: Article
  2. Publisher: 2007
  3. Abstract:
  4. The shortest path problem is a classical and important network optimization problem appearing in many applications. We discuss the shortest path problem from a specified vertex to every other vertex on a network with imprecise arc lengths as fuzzy numbers. Using an order relation between fuzzy numbers, we propose a new algorithm to deal with the fuzzy shortest path problem. The algorithm is composed of a fuzzy shortest path length procedure and a similarity measure. The fuzzy shortest length method is proposed to find the fuzzy shortest length, and the fuzzy similarity measure is utilized to get the shortest path. Two illustrative examples are worked out to demonstrate the proposed algorithm
  5. Keywords:
  6. Fuzzy numbers ; Fuzzy shortest path problems ; Fuzzy similarity ; Fuzzy similarity measure ; Network optimization problem ; Order relation ; Shortest path problem ; Similarity measure ; Algorithms ; Fuzzy logic ; Fuzzy rules ; Industrial engineering ; Networks (circuits) ; Graph theory
  7. Source: 37th International Conference on Computers and Industrial Engineering 2007, Alexandria, 20 October 2007 through 23 October 2007 ; Volume 1 , 2007 , Pages 556-563 ; 9781627486811 (ISBN)
  8. URL: https://www.researchgate.net/publication/289289325_Designing_a_new_algorithm_for_the_fuzzy_shortest_path_problem_in_a_network