Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions

Expert Systems with Applications

Volumn 37, Issue 3, 2010, Pages 1955-1972

  Martins, T C ^a   Tsuzuki, M S G ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

2D cutting and packing; Nesting; Optimization

Indexed keywords

2D CUTTING AND PACKING; BINARY SEARCH; DETERMINISTIC HEURISTICS; NESTING; NO-FIT POLYGON; NONCONVEX POLYGONS; SCALE FACTOR; TWO-DIMENSIONAL CONTAINERS;

ANNEALING; CONTAINERS; HEURISTIC METHODS; TWO DIMENSIONAL;

SIMULATED ANNEALING;

EID: 70449528599     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.06.081     Document Type: Article

References (37)

1. Anand S., McCord C., and Sharma R. An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms. Journal of Manufacturing Systems 18 (1999) 396-415
2. Art, R. C. (1966). An approach to the two-dimensional irregular cutting stock problem. IBM Cambridge Scientific Centre, Report 36-Y08.
3. Babu A.R., and Babu N.R. A generic approach for nesting of 2D parts in 2D sheets using generic and heuristic algorithms. Computer Aided Design 33 (2001) 879-891
4. Bennell J.A., and Dowsland K.A. Hybridizing tabu search with optimisation techniques for irregular stock cutting. Management Science 47 (2001) 1160-1172
5. Bohachevsky I.O., Johnson M.E., and Stein M.L. Generalized simulated annealing for function optimization. Technometrics 28 (1986) 209-217
6. Burke E.K., Hellier R.S.R., Kendall G., and Whitwell G. Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research 179 (2007) 27-49
7. Chazelle B. The polygon containment problem. Advances in Computing Research 1 (1983) 1-33
8. Corana A., Marchesi M., Martini C., and Ridella S. Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Transactions on Mathematical Software 13 (1987) 262-280
9. Daniels K., and Milenkovic V.J. Multiple translational containment. Part I: An approximate algorithm. Algorithmica 19 (1997) 148-182
10. Dicknson J.K., and Knopf G.K. A moment based metric for 2D and 3D packing. European Journal of Operational Research 122 (2000) 133-144
11. Dowsland K.A., Vaid S., and Dowsland B.W. An algorithm for polygon placement using a bottom-left strategy. European Journal of Operational Research 141 (2002) 371-381
12. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
13. Egeblad J., Nielsen B.K., and Odgaard A. Fast neighborhood search for two- and three-dimensional nesting problems. European Journal of Operational Research 183 (2007) 1249-1266
14. Ferreira, J. C., Alves, J. C., Albuquerque, C., Oliveira, J. F., Ferreira, S. F., & Matos, J.S. (1998). Flexible hardware acceleration for nesting problems. In Proceedings of the IEEE international conference on electronics, circuits and systems (pp. 345-348).
15. Fowler R.J., Paterson M., and Tanimoto S.L. Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12 (1981) 133-137
16. Gomes A.M., and Oliveira J.F. A 2-exchange heuristic for nesting problems. European Journal of Operational Research 141 (2002) 359-370
17. Gomes A.M., and Oliveira J.F. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research 171 (2006) 811-829
18. Hallah, R. M., Bouziri, A., & Jilani, W. (2001). Layout of two dimensional irregular shapes using genetic algorithms. Lecture Notes In Computer Science, 2070, 403-411.
19. Heckmann R., and Lengauer T. A simulated annealing approach to the nesting problem in the textile manufacturing industry. Annals of Operations Research 57 (1995) 103-133
20. Herz A., and Widmer M. Guidelines for use of meta-heuristics in combinatorial optimization. European Journal of Operational Research 151 (2003) 247-252
21. Hifi M., and Hallah R.M. Hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes. International Transaction in Operational Research 10 (2003) 195-216
22. Ingber L. Very fast simulated re-annealing. Mathematical and Computer Modelling 12 (1989) 967-973
23. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
24. Kirkpatrick S., Gellat C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
25. Kopardekar P., and Mital A. Cutting stock problem: A heuristic solution based on operator's intuitive strategies. International Journal of Computer Integrated Manufacturing 12 (1999) 371-382
26. Lamousin, H., & Waggenspack, Jr., W. N. (1997). Nesting of two dimensional irregular parts using a shape reasoning heuristic. Computer Aided Design, 29, 221-238.
27. Lee, W. C., Ma, H., & Cheng, B. H. (2008). A heuristic for nesting problems of irregular shapes. Computer Aided Design, 40, 625-633.
28. Leonov, M. V. (1988). Implementation of Boolean operations on sets of polygons in the plane. BS thesis, Novosibirsk State University (in Russian).
29. Liu D., and Teng H. An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. European Journal of Operational Research 112 (1999) 413-420
30. Matsumoto M., and Nishimura T. Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transactions on Modeling and Computer Simulation 8 (1998) 3-30
31. Milenkovic V.J. Multiple translational containment. Part II: Exact algorithms. Algorithmica 19 (1997) 183-218
32. Milenkovic V.J. Rotational polygon overlap minimization and compaction. Computational Geometry 10 (1998) 305-318
33. Tay F.E.H., Chong T.Y., and Lee F.C. Pattern nesting on irregular-shaped stock using genetic algorithms. Engineering Applications of Artificial Intelligence 15 (2002) 551-558
34. Theodoracatos V.E., and Grimsley J.L. The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules. Computer Methods in Applied Mechanics and Engineering (1995) 53-70
35. Wäscher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 (2007) 1109-1130
36. Wu, T. H., Chang, C. C., & Chung, S. J. (2008). A simulated annealing algorithm for manufacturing cell formation problems. Expert Systems with Applications, 34, 1609-1617.
37. Yeh, J. Y., & Fu, J. C. (2007). Parallel adaptive simulated annealing for computer-aided measurement in functional MRI analysis. Expert Systems with Applications, 33, 706-715.