Loading...

Algorithms for biobjective shortest path problems in fuzzy networks

Mahdavi, I ; Sharif University of Technology | 2011

468 Viewed
  1. Type of Document: Article
  2. Publisher: 2011
  3. Abstract:
  4. We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective problems. The first and second approaches are extensions of the labeling method to solve the single objective problem and the third approach is based on dynamic programming. The labeling methods usually producing several nondominated paths, we propose a fuzzy number ranking method to determine a fuzzy shortest path. Illustrative examples are worked out to show the effectiveness of our algorithms
  5. Keywords:
  6. Biobjective shortest path ; Dynamic programming ; Fuzzy network ; Fuzzy ranking methods ; Labeling method
  7. Source: Iranian Journal of Fuzzy Systems ; Volume 8, Issue 4 , November , 2011 , Pages 9-37 ; 17350654 (ISSN)
  8. URL: http://ijfs.usb.ac.ir/article_306_34.html