Education, Science, Technology, Innovation and Life
Open Access
Sign In

3D Bin Packing of Online Constrained Variable Size Sphere Based on Computer Simulation Technology

Download as PDF

DOI: 10.23977/acss.2022.060412 | Downloads: 23 | Views: 625

Author(s)

Chen Wang 1

Affiliation(s)

1 Hunan Modern Logistics College, Hunan, China

Corresponding Author

Chen Wang

ABSTRACT

Three dimensional packing problem is widely used in many fields. At present, the research on off-line 3D packing of rectangular objects is more extensive, while the research on on-line 3D packing of rectangular objects is relatively simple. In this paper, an online constrained variable size sphere three-dimensional packing problem based on computer simulation technology is proposed, and the solution to this problem is given. Due to the different weight of the sphere, the sphere is divided into different levels of cell size, and the sphere is loaded into the appropriate rhombic dodecahedron to form cells, and then loaded; Furthermore, according to the weighted method, the competitive ratio in the bounded environment can be obtained, which solves the packing problem of the same kind of goods with different weights on the assembly line.

KEYWORDS

3D packing, Online packing, Ball packing, Variable size, Simulation technology

CITE THIS PAPER

Chen Wang, 3D Bin Packing of Online Constrained Variable Size Sphere Based on Computer Simulation Technology. Advances in Computer, Signals and Systems (2022) Vol. 6: 94-98. DOI: http://dx.doi.org/10.23977/acss.2022.060412.

REFERENCES

[1] Bansal N, Correa J R, Kenyon C, et al. Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes[J]. Mathematics of Operations Research, 2006, 31(1):31-49.
[2] ShahinKamali, Alejandro Lo´pez-Ortiz, and Zahed Rahmati. Online Packing of Equilateral Triangles. In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG’2015), 2015.
[3] Flores J J, Martínez J, Calderón F. Evolutionary computation solutions to the circle packing problem[J]. Soft Computing, 2016, 20(4):1521-1535.
[4] Teng Hongfei, Liu Yijun, Ge Wenhai, et al. Layout optimization of cylinder group in rotating cone space [J]. Acta computa Sinica, 1993(7):519-525.
[5] Han, Xin, Ye, et al. A note on online hypercube packing[J]. Central European Journal of Operations Research, 2010, 18(2):221-239.
[6] Christensen H I, Khan A, Pokutta S, et al. Approximation and online algorithms for multidimensional bin packing: A survey ☆[J]. Computer Science Review, 2017, 24:S1574013716301356.
[7] Queiroz T A D, Hokama P H D B, Schouery R C S, et al. Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and Exact Approaches ☆[J]. Computers & Industrial Engineering, 2017, 105(Complete):313-328.
[8] Tatarevic M. On Limits of Dense Packing of Equal Spheres in a Cube[J]. Electronic Journal of Combinatorics, 2015, 22(1):1695-1697.
[9] Chen Hua. Research on two kinds of online algorithm problems [D]. Lanzhou University of technology, 2009.
[10] Cao Ju, Zhou Ji. An approximate algorithm for layout optimization of rectangular parts [J]. Chinese Journal of computer aided design and graphics, 2003, 28(6):190-195.

Downloads: 15009
Visits: 267238

Sponsors, Associates, and Links


All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.