Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 210, Issue 6, 1996, Pages 509-519

  Han, G C ^a   Na, S J ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Initial layout; Layout improvement; Nesting; Neural networks; Self organization assisted layout algorithm; Simulated annealing algorithm

Indexed keywords

ALGORITHMS; EFFICIENCY; HEURISTIC PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; NEURAL NETWORKS; OPTIMIZATION; SIMULATED ANNEALING;

NESTING;

CUTTING;

EID: 0030415037     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/PIME_PROC_1996_210_150_02     Document Type: Article

References (35)

1. Gilmore, P. C. and Gomory, R. E. Multistage cutting stock problems of two and more dimensions. Ops Res., 1965, 13, 94-120.
2. Gilmore, P. C. and Gomory, R. E. The theory and computation of knapsack functions. Ops Res., 1966, 14(61), 1045-1074.
3. Herz, J. C. Recursive computational procedure for two-dimensional stock cutting. IBM J. Res. Device, September 1972, 16(5), 462-469.
4. Adamowicz, M. and Albano, A. A solution of the rectangular cutting-stock problem. IEEE Trans. on Systems, Man and Cybernetics, April 1976, SMC-6(4), 202-210.
5. Christofides, N. and Whitlock, C. An algorithm for two-dimensional cutting problems. Ops Res., January-February 1977, 25(1), 30-44.
6. Madsen, O. B. G. Glass cutting in a small firm. Math. Programming, 1979, 17, 85-90.
7. Adamowicz, M. and Albano, A. Nesting two-dimensional shapes in rectangular modules. Computer-Aided Des., January 1976, 8(2), 27-33.
8. Albano, A. A method to improve two-dimensional layout Computer-Aided Des., January 1977, 9(1), 48-52.
9. Albano, A. and Sapuppo, G. Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. on Systems, Man and Cybernetics, May 1980, SMC-10(5), 242-248.
10. Nee, A. Y. C. A heuristic algorithm for optimum layout of metal stamping blanks. Ann. CIRP, 1984, 33(1), 317-320.
11. Nee, A. Y. C., Seow, K. W. and Long, S. L. Designing algorithm for nesting irregular shapes with and without boundary constraints. Ann. CIRP, 1986, 35(1), 107-110.
12. Sriram, M. and Kang, S. M. A modified hopfield network for two-dimensional module placement. Proceedings of IEEE International Symposium on Circuits system, 1990, pp. 1664-1667.
13. Zhang, C. and Mlynski, D. A. VLSI-placement with a neural network model. Proceedings of IEEE International Symposium on Circuits system, 1990, pp. 475-478.
14. Kohonen, T. The self-organizing map. Proc. IEEE, September 1990, 78(9), 1464-1480.
15. Kim, S. S. and Kjung, C. M. Circuit placement on arbitrarily shaped regions using the self-organization principle. IEEE Trans. on Computer Aided Des., July 1992, 11(7), 844-854.
16. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. Optimization by simulated annealing. Science, May 1983, 220(4598), 671-680.
17. Shahookar, K. and Mazumber, P. VLSI cell placement techniques. ACM Computing Surv., June 1991, 23(2), 143-164.
18. Heragu, S. S. and Alga, A. S. Experimental analyses of simulated annealing based algorithms for the layout problem. European J. Opl. Res., 1992, 57, 190-202.
19. Jain, P., Fenyes, P. and Richter, R. Optimal blank nesting using simulated annealing. Trans. ASME, J. Mech. Des., March 1992, 114, 160-165.
20. Cho, K. H. Integrated CAD/CAM system for fabrication of sheet metal parts. PhD thesis, Seoul National University, 1993.
21. Downsland, K. A. Some experiments with simulated annealing techniques for packing problems. European J. Opl Res., 1993, 68, 389-399.
22. Ismail, H. S. and Hon, K. K. B. New approach for the nesting of two-dimensional shapes for press tool design. Int. J. Prod. Res., 1992, 30(4), 825-837.
23. Fujita, K. and Gakkai, S. Approach for optimal nesting algorithm using genetic algorithm and local minimization algorithm. Trans. Jap. Soc. Mech. Engrs, Part C, 1993, 59(564), 2576-2583.
24. Bezdek, J. C., Tsao, E. C. K. and Pal, N. R. Fuzzy Kohonen clustering networks. IEEE International Conference on Fuzzy system, 1992, pp. 1035-1043.
25. Cenrny, V. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Opt. Theory and Applic., January 1985, 45(1), 41-51.
26. Sandgren, E. and Dworak, T. Part layout optimization using a quadtree representation. Proceedings of 1988 Design Automation Conference, Dissimmee, Florida, 1988, pp. 211-219.
27. Huntsberger, T. and Ajjimarangsee, P. Parallel self-organizing feature maps for unsupervised pattern recognition. Int. J. Gen. System, 1989, 16, 357-372.
28. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N. and Teller, A. H. Equation of state calculations by fast computing machines. J. Chem. Physics, 1953, 20(1334), 1087-1092.
29. Aarts, E. H. L. and Korst, J. H. M. Simulated annealing and Boltzmann machines, 1989, pp. 13-114 (John Wiley, New York).
30. Wasserman, P. D. Neural computing: theory and practice, 1989, pp. 77-92 (Van Nostrand Reinhold, New York).
31. Press, W. H., Flannery, B. P., Teukolsky, S.A. and Vetterling, W.T. Numerical recipes in C: the art of scientific computing, 1990, pp. 224-352 (Cambridge University Press, New York).
32. Rose, J., Klebsch, W. and Wolf, J. Temperature measurement and equilibrium dynamics of simulated annealing placements. IEEE Trans. on Computer Aided Des., March 1990, 9(3), 253-259.
33. Aarts, E. H. L. and van Laarhoven, P. J. M. A new polynomial-time cooling schedule. Proceedings of International Conference on Computer-aided design, November 1985, pp. 206-208.
34. Aarts, E. H. L., Korst, J. H. M. and van Laarhoven, P. J. M. A quantitative analysis of the simulated annealing: a case study for the traveling salesman problem. J. Statist. Physics, 1988, 50(1/2), 187-206.
35. Rutenbar, R. A. Simulated annealing algorithms: an overview. IEEE Circuits and Devices Mag., January 1989, 19-26.