کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4950991 | 1441164 | 2017 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The findings outcome from this study have shown that: (1) A universal listed of dynamic KNNACVRP; (2) Identified and built up an assessment measure for KNNACVRP; (3) Highlight the strategies, based KNNA operations, for choosing the most ideal way (4) KNNA finds a shorter route for VRP paths. The extent of lessening the distance for each route is generally short, but the savings in the distance becomes more noteworthy while figuring the aggregate distances traveled by all transports day by day or month to month. This applies likewise to the time calculate that has been decreased marginally in view of the rate of reduction in the distances of the paths.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational Science - Volume 21, July 2017, Pages 232-240
Journal: Journal of Computational Science - Volume 21, July 2017, Pages 232-240
نویسندگان
Mazin Abed Mohammed, Mohd Khanapi Abd Ghani, Raed Ibraheem Hamed, Salama A. Mostafa, Dheyaa Ahmed Ibrahim, Humam Khaled Jameel, Ahmed Hamed Alallah,