Determining Wood Sheet Cutting Pattern for Knockdown Furniture Using Heuristic Algorithms
Keywords:
Heuristic Algorithm, Wood sheet cutting pattern, Two-dimensional cutting stock problemAbstract
The objective of this research is to determine the wood sheet cutting pattern for knock-down cabinets of a furniture factory in order to reduce wasted wood sheets. The number and size of wood planks which are the components of the cabinet are arranged on the wood sheets using an effective heuristic algorithm called best fit direct algorithm. The program for calculating and processing the arrangement of the wood planks is developed by Microsoft Excel VBA. This program receives the input data, which are number and size of wood planks. These wood planks are arranged according to the best fit direct algorithm. The number of wood sheets and wood chips are figured out and shown in Table form. The arrangement of wood planks on every wood sheet is shown in 2D picture that is convenient for applications. The numerical results show that using the developed program can reduce wood chips by 29.93 %.
References
[2] Evtimov, G. and F. Stefka, “Heuristic Algolithm for 2D Cutting Stock Problem,” Large-Scale Scientific Computing, vol. 10665, pp. 350–357, 2018.
[3] จันทร์ศิริ สิงห์เถื่อน, “การวิจัยดำเนินงาน: อัลกอริทึมและการประยุกต์ใช้,” 2559.
[4] Gilmore, P. C. and R. E Gomory, “A Linear Programming Approach to The Cuttingstock Problem,” Operations Research, 9(6) pp. 849–859, 1961.
[5] Baker, S. B., E. G. Coffman JR. and Rivest R. L, “Orthogonal packings in two dimensions,” SIAM Journal on Computing, 9(4) pp. 846–855, 1980.
[6] Burke, E. K., G. Kendall and Whitwell G, “A New Placement Heuristic for The Orthogonal Stock-Cutting Problem,” Orthogonal packings in two dimensions,” Operations Research, 52(4) pp. 655-671, 2004.
[7] Coffman Jr, E. G., M. R. Garey, D. S. Johnson and R. E. Tarjan, “Performance Bounds for Level-Oriented Two Dimensional Packing Algorithms,” Society for Industrial and Applied Mathematics, 9(4) pp. 809-826, 1980.
[8] Barkey, J. O. and P. Y. Wang, “Two-Dimensional Finite Bin-Packing Algorithms,” Operational Research Society, 38(5) pp. 423–429, 1987.
[9] Bortfeldt, A, “A Genetic Algorithm for The Two-Dimensional Strip Packing Problem with Rectangular Pieces,” European Journal of Operational Research, 174 pp. 814-837, 2004.
[10] Ortmann, F. G., N. Ntene, J. H. V. Vuuren, “New and Improved Level Heuristics for The Rectangular Strip Packing and Variable-Sized Bin Packing Problems,” European Journal of Operational Research, 203(2) pp. 306-315, 2010.
[11] Park, K. T.,H. R. J. Ryu, H. K. Lee and I. B. Lee, “Development of A Heuristic Algorithm for Cutting Stock Problems in Flat Glass Production Processes,” Journal of Chemical Engineering of Japan, pp. 7-20, 2011 .
