کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6854985 1437601 2018 49 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Bacterial Memetic Algorithms for Order Picking Routing Problem with Loading Constraints
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Bacterial Memetic Algorithms for Order Picking Routing Problem with Loading Constraints
چکیده انگلیسی
The simulation results highlight, that allowing unit load reconstruction could decrease the order picking lead time and the developed BMA algorithms are more effective for OPRP-PLF than the SA algorithms. The paper concludes that the SA combined BMA operators are more effective than the SA-less operators in the case of shorter (less than about 20 records) order picking lists. While the shorter lists are the most commonly occurring order picking lists of warehouses, the SA combined BMA operators can increase the effectiveness of the OPRP-PLF optimisation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 105, 1 September 2018, Pages 196-220
نویسندگان
, ,