کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7436838 | 1483655 | 2018 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The two-dimensional vector packing problem with general costs
ترجمه فارسی عنوان
مشکل بسته بندی بردار دو بعدی با هزینه های عمومی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
استراتژی و مدیریت استراتژیک
چکیده انگلیسی
The two-dimensional vector packing problem with general costs (2DVPP-GC) arises in logistics where shipping items of different weight and volume are packed into cartons before being transported by a courier company. In practice, the delivery cost of a carton of items is usually retrieved from a cost table. The costs may not preserve any known mathematical function since it could specify arbitrary price at any possible weight. Such a general pricing scheme meets a majority of real-world bin packing applications, where the price of delivery service is determined by many complicated and correlated factors. Compared to the classical bin packing problem and its variants, the 2DVPP-GC is more complex and challenging. To solve the 2DVPP-GC with minimizing the total cost, we propose a memetic algorithm to compute solutions of high quality. Fitness functions and improved operators are proposed to achieve effectiveness. Computational experiments on a variety of test instances show that the algorithm is competent to solve the 2DVPP-GC. In particular, optimal solutions are found in a second for all the test instances that have a known optimal solution.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Omega - Volume 74, January 2018, Pages 59-69
Journal: Omega - Volume 74, January 2018, Pages 59-69
نویسندگان
Qian Hu, Lijun Wei, Andrew Lim,