Packing of polygons using genetic simulated annealing algorithm

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics

Volumn 15, Issue 5, 2003, Pages 598-603+609

  Chen, Yong ^a,b   Tang, Min ^a,b   Tong, Ruofeng ^a,b   Dong, Jinxiang ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Genetic simulated annealing algorithm; Heuristic algorithm; Nesting

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; SIMULATED ANNEALING;

GENETIC SIMULATED ANNEALING ALGORITHM; HEURISTIC ALGORITHM; NESTING;

COMPUTER AIDED DESIGN;

EID: 0041526702     PISSN: 10039775     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. P C Gilmore, R E Gomory. A linear programming approach to the cutting stock problem. - Part 1 [J]. Operations Research, 1961, 9(6): 848-859
2. J E Beasley. Algorithms for unconstrained two-dimensional guillotine cutting [J]. Journal of the Operational Research Society, 1985, 36(4): 297-306
3. A A Parley. Mathematical programming models for cutting-stock problems in the clothing industry [J]. Journal of the Operational Research Society, 1988, 39(1): 41-53
4. M S Reda, E A Abd. An interactive technique for the cutting stock problem with multiple objects [J]. European Journal of Operational Research, 1994, 78(3): 304-317
5. M Shpitalni, V Manevich. Optimal orthogonal subdivision of rectangular sheets [J]. Transactions of ASME Journal of Manufacturing Science and Engineering, 1996, 118(3): 281-288
6. M Adamowicz. The optimum two-dimensional allocation of irregular, multiple-connected shapes with linear, logical and geometric constraints [D]. New York: New York University, 1969
7. H H Yanasse, A S I Zinober, R G Harris. Two-dimensional cutting stock with multiple stock sizes [J]. Journal of the Operational Research Society, 1991, 42(8): 673-683
8. S Jakobs. On genetic algorithms for the packing of polygons [J]. European Journal of Operational Research, 1996, 88(1): 165-181
9. A Ramesh Babu, N Ramesh Babu. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms [J]. International Journal of Production Research, 1999, 37(7): 1625-1643
10. G-C Han, S-J Na. Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing [J]. Journal of Engineering Manufacture, 1996, 210 (B6): 509-519
11. H S Ismail, K K B Hon. The nesting of two-dimensional shapes using genetic algorithms [J]. In: Proceedings of Institution of Mechanical Engineers, London, 1995, 209: 115-124
12. S Jain, H G Chang. Two-dimensional packing problems using genetic algorithms [J]. Engineering with Computers, 1998, 14 (3): 206-213
13. A Ramesh Babu, N Ramesh Babu. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms [J]. Computer-Aided Design, 2001, 33(12): 879-891
14. B S Baker, E G Coffman, R L Rivest. Orthogonal packing in two dimensions [J]. SIAM Journal on Computing, 1980, 9(4): 846-855