کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
496786 | 862871 | 2009 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A dynamic programming approach for finding shortest chains in a fuzzy network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 9, Issue 2, March 2009, Pages 503–511
Journal: Applied Soft Computing - Volume 9, Issue 2, March 2009, Pages 503–511
نویسندگان
Iraj Mahdavi, Rahele Nourifar, Armaghan Heidarzade, Nezam Mahdavi Amiri,