Parameter Analysis of Placement Function for the Rectangular Packing Problem Based on GA

Abstract:

Rectangle part is the foundation of irregular part layout, about which domestic and overseas scholars have studied a lot and have put forward many algorithms. Based on a careful study of these algorithms in the paper, it is determined to solve the rectangle packing problem with genetic algorithm analysis. Different from the formerly used the genetic algorithm optimization layout, the algorithm of this paper stresses optimization localization rule in order to solve layout problem with the advantages of global searching ability of genetic algorithm. This algorithm sets the utilization ratio of the maximum area of capacity as the goal, after confirming the priority of deposition sequence of rectangle, in view of the locating rule of rectangle packing, based on feasible region and by introducing the method of attractive factors, optimizing the calculation for each parameter of placement function by utilizing genetic algorithm.Positioning function of the structure of this paper by changing the parameter value can cover the previous golden horn strategy, the lower left corner strategy, down the steps such as positioning method. Use VC programming to realize automatic two dimensional rectangular layout systems, the algorithm and example verification, the precision of parameter on the result of layout, the number of attractor for layout results, and the influence of parameter values for different rectangular piece of regularity. According to different rectangular block configuration, layout scheme can be better and faster.

• Periodical: Materials Science Forum (Volumes 836-837)
• Pages: 381-386
• DOI: https://doi.org/10.4028/www.scientific.net/MSF.836-837.381
• Online since: January 2016
• Authors: Yan Hua Zhu*
• Keywords: Genetic Algorithm, Parameter Analysis, Placement Function, Rectangle Packing

References

[1] Li Zhen-yu, Victor Milenkovic. Compaction and Separation Algorithms for Non-convex Polygons and their Applications. European Journal of Operation Research. 84 (1995)539-561.

DOI: 10.1016/0377-2217(95)00021-h

[2] WANG Jin-min, YANG Wei-jia. Dynamic attractive factors applied in packing problem. Journal of Computer-Aided Design & Computer Graphic. 17 (2005)1725-1729.

[3] Wang Jin-min, Zhu Yan-hua, Wang Bao-chun. A genetic algorithm for the rectangular packing problem of placement function. ITIC 2009, International. IET. (2009)96-100.

DOI: 10.1049/cp.2009.1474

[4] Hopper. E, Turton.B. An Empirical Investigation of Meta-heuristic and Heuristic Algorithm for a 2D Packing Problem. European Journal of Operational Research. 128(2001)34-57.

DOI: 10.1016/s0377-2217(99)00357-4