Abstract

The problem of packing a maximal number of items in the given set of equal capacity bins subject to Decision Maker’s (DM’s) preferences over the items is under consideration. The solution of this problem must satisfy the following conditions: (1) the total weight of items in a bin is not to be greater than the bin capacity; and (2) for each unpacked item there are no packed items less preferable for DM, instead of which it may be packed without violating the capacity limit. The approximate solution scheme for this problem based on modified First Fit Decreasing algorithm is proposed.

中文翻译：

---

取决于决策者偏好的逆装箱反问题的近似解决方案

摘要

正在考虑将最大数量的项目包装在给定的等容量垃圾箱中的问题，这取决于决策者（DM）对项目的偏好。该问题的解决方案必须满足以下条件：（1）储物柜中物品的总重量不得大于储物柜容量；（2）对于每个未包装的物品，没有没有比DM更可取的包装物品，而可以在不违反容量限制的情况下包装它。提出了一种基于改进的First Fit Decreasing算法的近似解决方案。