An optimizing model to solve the nesting problem of rectangle pieces based on genetic algorithm

In the process of cement equipment manufacturing, the demand of rectangle pieces of steel structure is very large. The traditional manual nesting, which is simply cutting by hand-making according to the arrangement of the number and size, causes the low efficiency and material wasting. To solve the problem above, this paper proposes an optimizing model for nesting problem of rectangle pieces. Firstly, with the aim of the maximum utilization ratio of the sheet, the optimization mathematical model for nesting problem of rectangle pieces is established. The lowest horizontal line searching algorithm is described in detail. Secondly, the mathematical model is solved to get the optimal solution by the combination of genetic algorithm and the lowest horizontal line searching algorithm. In the solution process, this paper presents the methods of gene encoding and decoding, definition of fitness function, the design of genetic operators and the design of algorithm operating parameters. Finally, we use one sheet as an example to illustrate the proposed model and algorithm process. Experimental results have shown that the proposed approach is able to achieve rectangle pieces nesting with the maximum material utilization ratio.

[1]  jinmin Wang,et al.  A genetic algorithm for the rectangular packing problem of placement function , 2009 .

[2]  Ping Ji,et al.  A hybrid genetic algorithm for component sequencing and feeder arrangement , 2004, J. Intell. Manuf..

[3]  Liu Xinbao,et al.  Study on solving rectangular packing problem by utilizing improved lowest horizontal search algorithm , 2009 .

[4]  Fu Yonggang,et al.  Point-based modeling from photographs and its photorealistic rendering , 2010 .

[5]  Qining Wang,et al.  Concept, Principle and Application of Dynamic Configuration for Intelligent Algorithms , 2014, IEEE Systems Journal.

[6]  Thomas Bräunl,et al.  Population variation in genetic programming , 2007, Inf. Sci..

[7]  Roberto Baldacci,et al.  Algorithms for nesting with defects , 2014, Discret. Appl. Math..

[8]  Bao Meng-hua,et al.  Improved genetic algorithm for two-dimensional irregular graph stock layout problem , 2013 .

[9]  J.T. Alander,et al.  On optimal population size of genetic algorithms , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.

[10]  George Chryssolouris,et al.  A decision-making approach for nesting scheduling: A textile case , 2000 .

[11]  Ahmad Mozaffari,et al.  Vector optimization of laser solid freeform fabrication system using a hierarchical mutable smart bee-fuzzy inference system and hybrid NSGA-II/self-organizing map , 2014, J. Intell. Manuf..

[12]  Gülfem Tuzkaya,et al.  A comparative analysis of meta-heuristic approaches for facility layout design problem: a case study for an elevator manufacturer , 2013, J. Intell. Manuf..

[13]  Jon Lee,et al.  In situ column generation for a cutting-stock problem , 2007, Comput. Oper. Res..

[14]  Richard J. Boucherie,et al.  Optimizing the strategic patient mix combining queueing theory and dynamic programming , 2014, Comput. Oper. Res..

[15]  Farouk Yalaoui,et al.  On-line maintenance job scheduling and assignment to resources in distributed systems by heuristic-based optimization , 2004, J. Intell. Manuf..

[16]  A. Sima Etaner-Uyar,et al.  Selection hyper-heuristics in dynamic environments , 2013, J. Oper. Res. Soc..

[17]  Achim Koberstein,et al.  Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method , 2013, Eur. J. Oper. Res..

[18]  Munir Pirmohamed,et al.  The population pharmacokinetics of R- and S-warfarin: effect of genetic and clinical factors. , 2012, British journal of clinical pharmacology.

[19]  José Fernando Oliveira,et al.  A 2-exchange heuristic for nesting problems , 2002, Eur. J. Oper. Res..

[20]  Qi Yue,et al.  Genetic annealing algorithm for cutting stock problem in furniture industry , 2009, 2009 IEEE 10th International Conference on Computer-Aided Industrial Design & Conceptual Design.

[21]  Peter Ross,et al.  Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems , 2010, Ann. Oper. Res..

[22]  K. A. Ariyawansa,et al.  On a New Collection of Stochastic Linear Programming Test Problems , 2004, INFORMS J. Comput..