Finding the optimal route for tourism using Dickstra's algorithm
Author(s):
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:
Tourism industry like other industries must apply the last and modern information and communication technology to develop. However, travel costs is one of the most important issues in this regards particularly when tour operators aim to planning towards determining tourism route. If we determine places visited by tourists as points on the map and draw communicational rout between these points, a set of points and routs in a graph can be showed. Each point indicates target point and each graphite edge indicates the rout between two points. Each graphite edge has a weight indicating cost, time or other travel indicators. Here, the issue is finding shortest, low cost or nearest routs between one point and other points. Therefore, this study aims to find this rout by using Dickstre's algorithm. This algorithm can be applied in software program related to services in tourism field towards planning tours.
Keywords:
Language:
Persian
Published:
Journal of tourism and leisure, Volume:5 Issue: 9, 2017
Page:
31
magiran.com/p1809490
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!