Survey on Certain and Heuristic Route Finding Algorithms in GIS
Author(s):
Abstract:
Traffic condition is one of the most important issues in urban transportation system of large cities, because it affects other important areas directly and indirectly. For example, water and air pollution as an environmental issue and physical or mental health of citizens as a health issue. Suggesting best routes based on different criteria such as traffic condition is one of the ways to reduce urban traffic, implicitly. In GIS, best routes can be suggested to users based on different algorithms that have been developed so far, to move in urban road network, and consider different costs, travel time, traffic, distance and other factors. Aim of this paper is reviewing route finding algorithms in GIS. For this purpose, algorithms are investigated in two categories, deterministic and heuristic algorithms. Advanced route finding problems which are closer to the real world problems are also described. Finally, a comparison between algorithms are done based on different parameters so that researchers can find the best suited algorithm based on their requirement.
Keywords:
Language:
Persian
Published:
Geospatial Engineering Journal, Volume:7 Issue: 4, 2016
Page:
25
magiran.com/p1639441
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!