این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Fuzzy Systems، جلد ۷، شماره ۳، صفحات ۱-۱۳
عنوان فارسی SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
چکیده فارسی مقاله Numerous algorithms have been proposed to solve the shortest-path
problem; many of them consider a single-mode network and crisp
costs. Other attempts have addressed the problem of fuzzy costs in
a single-mode network, the so-called fuzzy shortest-path problem
(FSPP). The main contribution of the present work is to solve the
optimum path problem in a multimodal transportation network, in
which the costs of the arcs are fuzzy values. Metropolitan
transportation systems are multimodal in that they usually contain
multiple modes, such as bus, metro, and monorail. The proposed
algorithm is based on the path algebra and dioid of $k$-shortest
fuzzy paths. The approach considers the number of mode changes,
the correct order of the modes used, and the modeling of two-way
paths. An advantage of the method is that there is no restriction
on the number and variety of the services to be considered. To
track the algorithm step by step, it is applied to a
pseudo-multimodal network.
کلیدواژه‌های فارسی مقاله Transportation، Multimodal، Shortest path، Dioid، Fuzzy cost، Graph، GIS،
عنوان انگلیسی SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
چکیده انگلیسی مقاله Numerous algorithms have been proposed to solve the shortest-path
problem; many of them consider a single-mode network and crisp
costs. Other attempts have addressed the problem of fuzzy costs in
a single-mode network, the so-called fuzzy shortest-path problem
(FSPP). The main contribution of the present work is to solve the
optimum path problem in a multimodal transportation network, in
which the costs of the arcs are fuzzy values. Metropolitan
transportation systems are multimodal in that they usually contain
multiple modes, such as bus, metro, and monorail. The proposed
algorithm is based on the path algebra and dioid of $k$-shortest
fuzzy paths. The approach considers the number of mode changes,
the correct order of the modes used, and the modeling of two-way
paths. An advantage of the method is that there is no restriction
on the number and variety of the services to be considered. To
track the algorithm step by step, it is applied to a
pseudo-multimodal network.
کلیدواژه‌های انگلیسی مقاله Transportation, Multimodal, Shortest path, Dioid, Fuzzy cost, Graph, GIS
نویسندگان مقاله علی گلنار کار |
department of gis engineering, k. n. toosi university of technology, valiasr street, mirdamad cross, p.c. 19967-15433, tehran, iran
سازمان اصلی تایید شده: دانشگاه صنعتی خواجه نصیرالدین طوسی (Khajeh nasir toosi university of technology)

علی اصغر آل شیخ | ali asghar
department of gis engineering, k. n. toosi university of technology, valiasr street, mirdamad cross, p.c. 19967-15433, tehran, iran
سازمان اصلی تایید شده: دانشگاه صنعتی خواجه نصیرالدین طوسی (Khajeh nasir toosi university of technology)

محمدرضا ملک | mohamad reza
department of gis engineering, k. n. toosi university of technology, valiasr street, mirdamad cross, p.c. 19967-15433, tehran, iran
سازمان اصلی تایید شده: دانشگاه صنعتی خواجه نصیرالدین طوسی (Khajeh nasir toosi university of technology)

نشانی اینترنتی http://ijfs.usb.ac.ir/article_184_f7dc9d13a3aa140362cfd8b83d059aef.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده fa
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات