Application of Genetic Algorithm on the Layout of Rectangular

Article Preview

Abstract:

This article adopts genetic algorithm to solve the problem of guillotine rectangular stock cutting, and designs a new crossover operator and mutation operator towards the specifical problem, finally gives an example to prove this new genetic algorithm is effective to solve the rectangular cutting problem

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 314-316)

Pages:

1234-1237

Citation:

Online since:

August 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Gilmore P C,Gomory R E.A linear programming approach to the cutting—stock problem(Part1) [ J ].operations Research, 9(1961),p.849—859.

DOI: 10.1287/opre.9.6.849

Google Scholar

[2] Gilmore P C,Gomory R E.A linear programming approach to the cutting—stock problem(Part2 ) [ J ].Operations Research,11(1963),p.863—888.

DOI: 10.1287/opre.11.6.863

Google Scholar

[3] Gilmore P C,Gomory R E. Multistage cutting—stock problems of two and more dimensions [ J ].Operations Research,13(1965),p.94—120.

DOI: 10.1287/opre.13.1.94

Google Scholar

[4] Ji Jin, Huang. Two-dimensional guillotine rectangular stock cutting optimization with predetermined in-depth search steps [ J ].Journal of Computer-Aided Design and Computer Graphics, 6, 4.(1994),p.313—31 6.

Google Scholar

[5] Huang W Q,Chen D B,Xu RC.A new heuristic algorithm for rectangle packing [ J ].Computers & Operations Research, 34,11.(2007),p.3270—3280.

DOI: 10.1016/j.cor.2005.12.005

Google Scholar

[6] ZhiXin,-Jia, GuoFu-Yin, Yang-luo. Application of Simulated Annealing to the Rectangular Packing Problem[J]].Journal of Sichuan University: Engineering Science Edition ,2001(5),p.32—34.

Google Scholar