کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
479707 1446024 2014 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A fast algorithm for identifying minimum size instances of the equivalence classes of the Pallet Loading Problem
ترجمه فارسی عنوان
یک الگوریتم سریع برای شناسایی نمونه های حداقل اندازه از کلاس های هم ارز در مسئله بارگیری پالت
کلمات کلیدی
بسته بندی، مشکل در بارگیری پالت، کلاس هم ارز
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی


• The paper deals with minimum size instance of the Pallet Loading Problem.
• A faster Minimum Size Instance (MSI) identification algorithm is presented.
• A faster minimum size instance enumerating algorithm is presented.
• The two algorithms improve solution schemes that require MSI identification.

In this paper, a novel and fast algorithm for identifying the Minimum Size Instance (MSI) of the equivalence class of the Pallet Loading Problem (PLP) is presented. The new algorithm is based on the fact that the PLP instances of the same equivalence class have the property that the aspect ratios of their items belong to an open interval of real numbers. This interval characterises the PLP equivalence classes and is referred to as the Equivalence Ratio Interval (ERI) by authors of this paper. The time complexity of the new algorithm is two polynomial orders lower than that of the best known algorithm. The authors of this paper also suggest that the concept of MSI and its identifying algorithm can be used to transform the non-integer PLP into its equivalent integer MSI.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 237, Issue 3, 16 September 2014, Pages 794–801
نویسندگان
, ,