The Three-dimensional Bin Packing Problem for Deformable Items

Zuo, Qiruyi; Liu, Xinglu; Xu, Lu; Li, Xiao; Xu, Chengyin; Liu, Jianfeng; Chan, Wai Kin Victor

doi:10.1109/ieem55944.2022.9989600

Cited by 6 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Розміщення об'єктів, що мають змінну просторову форму, у подальшому, м'яких об'єктів, використовується в біології [4], механікі [5], матеріалознавстві [6]. Пакування м'яких прямокутників можна знайти в землевідведенні [7] та логістиці [8]. Пакування м'яких трикутників виникає при генерації сіток для кінцево-елементного аналізу [9].…”

Section: розглянуто задачу пакування опуклих багатокутників у прямоку...unclassified

Packing Soft Polygons in a Minimum Height Rectangular Target Domain

Melashenko,

Romanova,

Pankratov

et al. 2024

Cybernetics and Computer Technologies

View full text Add to dashboard Cite

The paper studies packing polygons of variable shapes, regarding the stretching coefficient, in a rectangular target domain of minimum height. Packing objects of a variable shape have a wide spectrum of applications, e.g, in biology, materials science, mechanics, land allocation, and logistics. Interest in these problems is also due to the modeling of the structures of porous media under pressure, e.g., for creating test models of artificial digital cores. Elements of porous media can be deformed under the influence of an external force, but the mass of each particle remains unchanged. This corresponds to conservation of area for the two-dimensional case. Polygonal objects must be completely contained within the target domain (containment constraint) and do not overlap (non-overlapping constraint), provided they have free translations, continuous rotations, stretch transformations, and conserve their area. The phi-function technique is used for an analytical description of the placement constraints for variable shape polygons. Quasi-phi-functions for describing non-overlapping constraints and phi-functions for describing containment constraints are defined. The packing problem is presented in the form of a nonlinear programming model. A solution strategy is proposed, which consists of the following stages: generation of feasible starting points; search for local minima of the problem of packing soft polygons for each starting point using the decomposition algorithm; choosing the best local minimum found at the previous stage. To search for smart starting arrangements, an optimization algorithm for packing original polygons using their homothetic transformations is applied. Decomposition of the problem of packing polygons of variable shapes is based on an iterative procedure that allows reducing a large-scale problem to a sequence of smaller nonlinear programming problems (linear to the number of objects). Numerical examples are provided for oriented rectangles and non-oriented regular polygons. Keywords: packing, polygons, stretch transformation, rectangular container, quasi-phi-functions, optimization, decomposition algorithm.

show abstract

Section: розглянуто задачу пакування опуклих багатокутників у прямоку...unclassified

Packing Soft Polygons in a Minimum Height Rectangular Target Domain

Melashenko,

Romanova,

Pankratov

et al. 2024

Cybernetics and Computer Technologies

View full text Add to dashboard Cite

show abstract

“…The effectiveness and fast computational times of their method were tested by the authors. Similarly, in order to further increase the loading efficiency and reduce the operating costs in fresh food Supply Chain industries, a 3DBPP variation was presented in [21]. The compressibility factor of deformable items, like vegetables and fruits, was considered in a mixed integer programming model.…”

Section: Exact Algorithmsmentioning

confidence: 99%

“…A literature search was conducted on databases such as Google Scholar, Science Direct, arXiv, the Institute of Electrical and Electronics Engineers (IEEE), Multidisciplinary Digital Publishing Institute (MDPI), and Scopus. More than 200 scientific papers were searched and reviewed related to their relevance, in accordance with which this procedure appears under various names, like "palletising" [7][8][9], "palletizing" [10][11][12], "palletisation" [13,14], "palletization" [6,15,16], "pallet loading problem" [17][18][19], "pallet placement" [13,14,20], and "3D Bin Packing Problem" (pallet version as opposed to packing packages and loading containers) [21,22]. To address this ongoing issue, a typology was proposed in 1990 [23] and in 2007 [24] by researchers that concerns the area of Cutting and Packing problems.…”

Section: Introductionmentioning

confidence: 99%

“…A Distributor's Pallet Packing/Loading Problem is a term that also appears in the literature, with the intent of distinguishing it from its Manufacturer counterpart, where all boxes are identical [18]. In all proposed solutions, there are constraints present (geometry, weight, stability [25], compression [21], center of gravity [26][27][28], shipment cost [29], fragility [30], packing sequence [31], load bearing [32,33], and profit optimization [34]) that make computations even more complex. Even the complexity of package arrangements on the pallet itself is a practical constraint [35].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods

Daios,

Kladovasilakis,

Kostavelis

2024

Sustainability

View full text Add to dashboard Cite

Mixed palletizing constitutes one of the problems in the logistics domain aroused from the need for fast product movement to satisfy the continuously increasing number of customers with the demand for highly personalized goods. In a demanding environment, such as warehouses, where break bulk and the consolidation of loads take up most of the working time, the automation of mixed palletizing can lead to increased efficiency and speed while keeping errors to a minimum. Space utilization of pallets enables savings in storage and transportation costs, boosting the overall sustainable role of the Supply Chain sector. This paper presents the proposed approaches to mixed palletizing stemming from different fields, with a focus on recent developments in the application of Industry 4.0 technologies. Our research highlights quite a few areas that require attention from researchers.

show abstract