CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

عنوان مقاله: ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
شناسه ملی مقاله: JR_IJFS-8-4_003
منتشر شده در در سال 1390
مشخصات نویسندگان مقاله:

Iraj Mahdavi - Department of Industrial Engineering, Mazandaran University of Sci- ence & Technology, Babol, Iran
Nezam Mahdavi-Amiri - Faculty of Mathematical Sciences, Sharif University of Tech- nology, Tehran, Iran
Shahrbanoo Nejati - Department of Industrial Engineering, Mazandaran University of Science & Technology, Babol, Iran

خلاصه مقاله:
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 prob- lems. The rst 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 short- est path. Illustrative examples are worked out to show the eectiveness of our algorithms.

کلمات کلیدی:
Biobjective shortest path, Fuzzy network, Labeling method, Dynamic programming, Fuzzy ranking methods

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1476633/