Skip to main content
Log in

Two-dimensional nesting system based on hybrid genetic algorithm

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

According to the cutting stock problem of 2-dimensional shapes, a nesting system (NS) based on hybrid genetic algorithm (HGA) is established. The system optimizes the sequence and angles of polygons with hybrid Genetic Algorithm to accomplish the superior solution. It nests the irregular shape directly without covering irregular shapes with rectangle. It also improves the decoding strategy of 2-dimensional shapes nesting based on classical bottom-left strategy, makes the new strategy be universal to convex polygons, concave polygon and line-circular composted polygons.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Jiang J Q, Xing X L, YANG X W, et al. A Hybrid Algorithm Based on PSO and SA and Its Application for Two-Dimensional Non-Guillotine Cutting Stock Problem [C]//Proceedings of the Third International Conference on Machine Learning and Cybernetics. Shanghai: IEEE Press, 2004: 2198–2201.

    Google Scholar 

  2. Terashima M, Farias-Zarate C J, Ross P, et al. A GA-Based Method to Produce Generalized Hyper-Huristics for the 2D-Regular Cutting Stock Problem[C]//Proceedings of the Genetic and Evolutionary Computation Conference 2006, Seattle: ACM Press, 2006: 591–598.

    Chapter  Google Scholar 

  3. Bennell J A, Dowsland K A, Dowsland W B. The Irregular Cutting-Stock Problem—A New Procedure for Deriving the No-Fit Polygon[J]. Computers & Operations Research, 2001, 28: 271–287.

    Article  Google Scholar 

  4. Edmund B, Robert H. A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem [J]. Operations Research, 2006. 54(3): 587.

    Article  MathSciNet  Google Scholar 

  5. Hifi M. Exact Algorithms for the Guillotine Strip Cutting/Packing Problem[J]. Computers & Operations Research, 1998, 25(11): 925–940.

    Article  MATH  Google Scholar 

  6. Jia Z, Yin G F, Luo Y. Two-Dimensional Irregular Parts Packing with Genetic Algorithm[J]. Journal of Computer Aided Design & Computer Graphics, 2002, 14(5): 467–470 (Ch)

    Google Scholar 

  7. Liu Jiamin, Zhang Shengnan, Huang Youqun. Research and Implementation of Two Dimensional Irregular Auto Nesting Algorithm[J]. Journal of Computer Aided Design & Computer Graphics, 2000, 12(7): 488–491(Ch)

    Google Scholar 

  8. Hong L, Wang Y. A Rapid Decoding Algorithm of Irregular Parts Packing[J]. Journal of Computer Aided Design & Computer Graphics, 2005, 117(111): 2465–2470(Ch)

    Google Scholar 

  9. Mitsuo G, Cheng R W. Genetic Algorithms and Engineering Design[M]. Hoboken: John Wiley & Sons, 1997.

    Google Scholar 

  10. Wang Ling. Shop Shedule with Genetic Algorithm[M]. Beijing: Tsinghua University Press, 2003: 56–85(Ch)

    Google Scholar 

  11. Jeff J. The Genetic Algorithm Optimization Toolbox (GAOT) for Matlab[EB/OL].[2007-05-11].http://www.ise.ncsu.edu/mirage/GAToolBox/gaot.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qingming Wu.

Additional information

Foundation item: Supported by the National Key Technology and Equipment Project of the 10th Five-Year Plan (ZZ02-03-03-01)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Q., Yang, W., Zhang, Q. et al. Two-dimensional nesting system based on hybrid genetic algorithm. Wuhan Univ. J. Nat. Sci. 14, 60–64 (2009). https://doi.org/10.1007/s11859-009-0113-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-009-0113-0

Key words

CLC number

Navigation