|
|
International Journal of Supply and Operations Management، جلد ۳، شماره ۳، صفحات ۱۳۷۳-۱۳۹۰
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژههای فارسی مقاله |
|
|
| عنوان انگلیسی |
Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route |
|
| چکیده انگلیسی مقاله |
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM) and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm. |
|
| کلیدواژههای انگلیسی مقاله |
Vehicle Routing problem , Multi-Depot , Flexible End Depot , Genetic Algorithm , Clustering , |
|
| نویسندگان مقاله |
| Mohammad Mirabi
Department of industrial engineering, Ayatollah Haeri University of Meybod, Meybod, Yazd, Iran
| Nasibeh Shokri
Group of industrial engineering, ElM-O-Honar University, Yazd Iran
| Ahmad Sadeghieh
Group of industrial engineering, Yazd University, Yazd, Iran
|
|
| نشانی اینترنتی |
http://system.khu.ac.ir/ijsom/browse.php?a_code=A-10-610-1&slc_lang=fa&sid=1 |
| فایل مقاله |
فایلی برای مقاله ذخیره نشده است |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
fa |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
Research Paper |
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|
