A dynamic programming approach for finding shortest chains in a fuzzy network

  • Authors:

  • Iraj Mahdavi;Rahele Nourifar;Armaghan Heidarzade;Nezam Mahdavi Amiri

  • Affiliations:

  • Department of Industrial Engineering, College of Technology, Mazandaran University of Science & Technology, P.O. Box 734, Babol, Iran;Department of Industrial Management, Azad University Branch of Babol, Iran;Department of Industrial Engineering, College of Technology, Mazandaran University of Science & Technology, P.O. Box 734, Babol, Iran and Department of Industrial Engineering, Payame Noor Universi ...;Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graph theory has numerous applications to problems in systems analysis, operations research, transportation, and economics. In many cases, however, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to make use of fuzzy set theory to deal with the uncertainty. Here, we are concerned with finding shortest chains in a graph with fuzzy distance for every edge. We propose a dynamic programming approach to solve the fuzzy shortest chain problem using a suitable ranking method. By using MATLAB, two illustrative examples are worked out to demonstrate the proposed algorithm.