این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
International Journal of Engineering، جلد ۲۷، شماره ۷، صفحات ۱۱۱۳-۱۱۲۶
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
چکیده انگلیسی مقاله In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retailer. This problem is known as NP-hard problem. Two meta-heuristic algorithms based on the Tabu search (TS) algorithm and variable neighborhood search (VNS) are proposed for its solution. These algorithms are designed for real-world cases and can be generalized to the more complex models such as those which deliveries can be specified in a split form. The proposed TS algorithm also offers a candidate list strategy which has no limitation for the number of nodes and vehicles. A computational experiment is performed to verify our presented algorithms. Through computational experiments, it is indicated that the proposed TS algorithm performs better than VNS algorithm in both aspects of the total cost and computation time.
کلیدواژه‌های انگلیسی مقاله
نویسندگان مقاله Ali Sadri Esfahani |
Industrial Engineering, Science and Art University, Yazd, Iran

M.B. Fakhrzad |
industrial engineering, Yazd University

نشانی اینترنتی http://www.ije.ir/article_72345_e166781eb35b615116e58fbc7e443867.pdf
فایل مقاله اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062696.pdf
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات