Abstract
The problem of placing a number of specific shapes on a raw material in order to maximize material utilization is commonly encountered in the production of steel bars and plates, papers, glasses, etc. In this paper, we presented a genetic algorithm for steel grating nesting design. For application in large-scale discrete optimization problems, we also implemented this algorithm with CUDA based on parallel computation. Experimental results show that under genetic algorithm invoking with CUDA scheme, we can obtain satisfied solutions to steel grating nesting problem with high performance.
Publisher
Trans Tech Publications, Ltd.
Reference16 articles.
1. Fowler, R. J., Paterson, M. S., & Tatimoto, S. L. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12, 133–137, (1981).
2. Holland, J. H. Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press, (1975).
3. Hopper, E., & Turton, B. C. H. A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering, 37(1–2), 375–378, (1999).
4. Hopper, E., & Turton, B. C. H. A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review, 16, 257–300, (2001).
5. K.A. Dowsland., & W.B. Dowsland, Solution approaches to irregular nesting problems, European Journal of Operations Research Elsevier, vol. 84, p.506–521, (1995).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献