کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7124820 | 1461527 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A decremental approach with the Aâ algorithm for speeding-up the optimization process in dynamic shortest path problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A decremental approach with the Aâ algorithm for speeding-up the optimization process in dynamic shortest path problems A decremental approach with the Aâ algorithm for speeding-up the optimization process in dynamic shortest path problems](/preview/png/7124820.png)
چکیده انگلیسی
Dynamic (time-dependent) network routing has become important due to the deployment of advanced traveler information systems in navigation systems. We study the problem of speeding-up the shortest path in continuous-time dynamic networks without a priori knowledge of the link travel times. We apply the Aâ algorithm using the decremental approach to reduce the network size and speed-up the optimization process in dynamic shortest path problems. We utilize the weighted metric multidimensional scaling technique to define the potential function in the Aâ algorithm by converting the link travel costs (times) into distances. Moreover, we evaluate the performance of the decremental approach with respect to the CPU times and optimal costs by applying the Aâ algorithm and Dijkstra's algorithm to different networks.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Measurement - Volume 60, January 2015, Pages 299-307
Journal: Measurement - Volume 60, January 2015, Pages 299-307
نویسندگان
Mostafa K. Ardakani, Madjid Tavana,