کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1024082 941666 2008 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the multi-product packing-delivery problem with a fixed route
موضوعات مرتبط
علوم انسانی و اجتماعی مدیریت، کسب و کار و حسابداری کسب و کار و مدیریت بین المللی
پیش نمایش صفحه اول مقاله
On the multi-product packing-delivery problem with a fixed route
چکیده انگلیسی

We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3 log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 44, Issue 3, May 2008, Pages 350–360
نویسندگان
, , ,