Towards Bin Packing (preliminary problem survey, models with multiset estimates)
This is an incremental contribution that provides a generalized framework for bin packing, potentially aiding researchers and practitioners in optimization domains.
The paper tackles bin packing problems by proposing a new systemic viewpoint and formulations for cases with multiset estimates of items, including applied examples in industries like paper planning and WiMAX communication.
The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatibility, precedence, dominance; relation over items and bins (i.e., correspondence of items to bins). A special attention is targeted to the following versions of bin packing problems: (a) problem with multiset estimates of items, (b) problem with colored items (and some close problems). Applied examples of bin packing problems are considered: (i) planning in paper industry (framework of combinatorial problems), (ii) selection of information messages, (iii) packing of messages/information packages in WiMAX communication system (brief description).