Loading...

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

Mahdavi, I ; Sharif University of Technology | 2009

415 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.asoc.2008.07.002
  3. Publisher: 2009
  4. Abstract:
  5. 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. © 2008 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Fuzzy sets ; Graph theory ; MATLAB ; Motor transportation ; Set theory ; Systems analysis ; Systems engineering ; Traffic control ; Fuzzy network ; Fuzzy shortest chain ; Ranking methods ; Road networks ; Travel time ; Vehicle capacity ; Dynamic programming
  8. Source: Applied Soft Computing Journal ; Volume 9, Issue 2 , 2009 , Pages 503-511 ; 15684946 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S1568494608001105