Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms

International Journal of Production Research

Volumn 37, Issue 7, 1999, Pages 1625-1643

  Babu, A Ramesh ^a   Babu, N Ramesh ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

HEURISTIC ALGORITHMS; MULTIPLE RECTANGULAR SHEET MATERIALS;

PRODUCTION CONTROL;

EID: 0033131702     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499191166     Document Type: Article

References (18)

1. Albano, A. and Orsini, R., 1979, A heuristic solution of the rectangular cutting stock problem. The Computer Journal, 23, 338-343.
2. Beasley, J. E., 1985, Algorithms for unconstrained two-dimensional guillotine cutting. Journal of Operational Research Society, 36, 297-306.
3. Bengtsson, B. E., 1982, Packing rectangular pieces -a heuristic approach. The Computer Journal, 25, 353-357.
4. Chambers, L., 1995, Practical Handbook of Genetic Algorithms (N.W: CRC Press).
5. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning (Reading, MA: Addison-Wesley).
6. Han, G. C. and Na, S. J, 1996, Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing. Proceeding of Institution of Mechanical Engineers, Journal of Engineering Manufacture, 210, 509-519.
7. Ismail, H. S. and Hon, K. K. B., 1992, New approaches for the nesting of two-dimensional shapes for press tool design. International Journal of Production Research, 30, 825-837.
8. Ismail, H. S. and Hon, K. K. B., 1995, The nesting of two-dimensional shapes using genetic algorithms. Proceeding of Institution of Mechanical Engineers, Journal of Engineering Manufacture, 209, 115-124.
9. Jain, P., Fenyes, P. and Richter, R., 1992, Optimal blank nesting using simulated annealing. Transactions of AS ME, Journal of Mechanical Design, 114, 160-165.
10. Jakobs, S., 1996, Theory and methodology on genetic algorithms for the packing of polygons. European Journal of Operational Research, 88, 165-181.
11. Lamousin, H. J. and Waggenspack, W. N., 1997, Nesting of two-dimensional irregular parts using a shape reasoning heuristic. Computer Aided Design, 29, 221-238.
12. Lamousin, H. J., Waggenspack, W. N. and Dobson, G. T., 1996, Nesting of complex 2-D parts within irregular boundaries. Transactions of AS ME, Journal of Manufacturing Science and Engineering, 118, 615-622.
13. Reda, M. S. and Abd, E. A, 1994, An interactive technique for the cutting stock problem with multiple objectives. European Journal of Operational Research, 78, 304-317.
14. Reeves, C. R., 1993, Modern Heuristic Techniques for Combinatorial Problems (Oxford)
15. Nee, A. Y. C., Seow, K. W., Long, S. L. and Venkatesh, V. C., 1986, Designing algorithm for nesting irregular shapes with and without boundary constraints. Annals of CIRP, 35, 107-110.
16. Prasad, Y. K. D. V., Somasundaram, S. and Rao, K. P., 1995, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks. International Journal of Production Research, 33, 1505-1520.
17. Shpitalni, M. and Manevich, V., 1996, Optimal orthogonal subdivision of rectangular sheets. Transactions of the AS ME, Journal of Manufacturing Science and Engineering, 118, 281-288.
18. Yanasse, H. H., Zinober, A. S. I. and Harris, R. G., 1991, Two-dimensional cutting stock with multiple stock sizes. Journal of Operational Research Society, 42, 673-683.