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

Batch optimization of rectangular parts

Download as PDF

DOI: 10.23977/ieim.2023.060402 | Downloads: 5 | Views: 382

Author(s)

Yuan Xiqin 1

Affiliation(s)

1 College of Science, Inner Mongolia University of Technology, Hohhot, Inner Mongolia Autonomous Region, 010051, China

Corresponding Author

Yuan Xiqin

ABSTRACT

In the field of modern industry, cutting material for industrial manufacturing essential basic process. In recent years, in order to meet the needs of national industrial development, the research on cutting has made rapid progress. Due to the different demands of different orders in the process of product production, and the cutting and cutting need to meet the constraints of "simultaneous cutting". Aiming at the common batch optimization problem of square parts, this paper mainly focuses on the two-dimensional three-stage shearing and cutting problem, aiming to minimize the use of original pieces and the lowest utilization rate of original pieces. By using genetic algorithm, product items or strip arrangement schemes are numbered to form chromosomes. Secondly, by initializing the population, evaluating the fitness of individuals in the population, selecting, crossing and other steps, Select the best layout solution. Finally, through the utilization rate of the original sheet, it is proved that the method proposed in this paper can effectively solve the typesetting problem of square parts, improve the utilization rate of raw materials, and improve the production flexibility to a certain extent.

KEYWORDS

Square parts; Cutting and blanking; Typesetting method; Genetic algorithm; Linear programming algorithm

CITE THIS PAPER

Yuan Xiqin, Batch optimization of rectangular parts. Industrial Engineering and Innovation Management (2023) Vol. 6: 10-20. DOI: http://dx.doi.org/10.23977/ieim.2023.060402.

REFERENCES

[1] Pan W P, Chen Q L, Cui Y D. Research on Optimal two-section Layout Algorithm considering the number of cutters [J]. Journal of Guangxi University (Natural Science Edition). Volume 39, Issue 3: 687-692, 2014.
[2] Tan B, Yan C P, Wang K, Liu F. Large Scale Parts Group Optimization Method Based on Blanking Characteristics [J]. Journal of Computer Aided Design and Computer Graphics. Volume 24, Issue 3: 387-393, 2012.
[3] Chen L, Huang W J, Feng Z, et al. Mathematical model of practical blanking [J]. Mathematical practice and understanding. Issue 7: 58-63, 2005.
[4] Zhang K, Lin J H. Research progress of two-dimensional blanking [J]. Journal of Shandong University (Engineering Science). Vol. 35 Supplement: 129-132. 2005.
[5] Garey M R, Johnson D S. Computer and intractability guide to the theory of NP-completeness [M]. San Francisco: W H Freeman Company. 1979.
[6] Cao J, Zhou J, Yu J. Knapsack Algorithm for Layout Optimization of Rectangular Parts [J]. China Mechanical Engineering. Issue 2: 11-12, 1994. 
[7] Huang W Q, Chen D B, Xu R C. A new heuristic algorithm for rectangle packing [J]. Computers & Operations Research. Volume 34, Issue 11: 3270-3280, 2007.
[8] Jai Z X, Yin G F, Luo Y. Simulation Annealing Algorithm for Rectangular Parts Layout [J]. Journal of Sichuan University: Engineering Science Edition. Issue 5:35-38, 2001.
[9] Jakobs S. On genetic algorithms for the packing of polygons [J]. European Journal of Operational Research. Volume 88, Issue 1: 165-161, 1996.
[10] Hopper E, Turton B. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem [J]. European Journal of Operational Research. Volume 128, Issue 1: 34-57, 2001.
[11] Liu D Q. Genetic Algorithm for Solving Rectangular Parts Layout Problem [J]. Minicomputer. Volume 19 Issue 12: 20-25, 1998.
[12] Zhang D, Liu Y, Chen S, Xie X. A meta-heuristic algorithm for the strip rectangular packing problem [J], Lecture Notes in Computer Science. 1235-1241, 2005.
[13] Cui Y, Yang Y, Chen X, Song P. A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem [J]. Computers & Operations Research. Volume 35, Issue 4: 1281-1291, 2008.
[14] Qi R Z, Wang Z J. Li S Y. A Parallel Genetic Algorithm Based on Spark for Pairwise Test Suite Generation[J], Journal of Computer Science and Technology, Volume 31, Issue 2: 417-427, 2016.

Downloads: 11610
Visits: 276513

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

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