An Improved Approach for Solving Interval Shortest Path Problem
محل انتشار: چهاردهمین کنفرانس سیستم های فازی ایران
سال انتشار: 1394
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 560
فایل این مقاله در 5 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICFUZZYS14_064
تاریخ نمایه سازی: 21 اردیبهشت 1397
چکیده مقاله:
The shortest path (SP) problem concentrates on finding the path with minimum distance, time or cost from a source node to the destination node. However, the costs of many real world applications are not deterministic numbers. In these cases, using interval numbers for modeling the problem is quite appropriate, and the interval shortest path (ISP) problem appears in a natural way. An existing algorithm for solving ISP problem is based on the acceptability index for comparison of any two interval arc weights. Here it is shown that once the acceptability index is chosen, the ISP problem is converted into crisp one, which is easily solved by the standard SP algorithms.
کلیدواژه ها:
نویسندگان
Eshagh Hashemi
Academic member, Department of Mathematics, Qaemshahr Branch, Islamic Azad University Qaemshahr, Iran,
Ali Ebrahimnejad
Academic member, Department of Mathematics, Qaemshahr Branch, Islamic Azad University Qaemshahr, Iran,