Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle

Journal of Zhejiang University: Science

Volumn 7, Issue 4, 2006, Pages 570-576

  Liu, Hu Yao ^a   He, Yuan Jun ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Cutting stock; Genetic algorithm (GA); Lowest gravity center; Nesting; No Fit Polygon (NFP)

Indexed keywords

GENETIC ALGORITHMS; GRAVITATION; MATHEMATICAL TECHNIQUES; THEOREM PROVING;

ARBITRARY ROTATION; BENCHMARK DATASETS; COMPUTATIONAL GEOMETRY TOOLS; CUTTING STOCK; LOWEST GRAVITY CENTER; NESTING PROBLEM; NO FIT POLYGON (NFP); PLACEMENT PRINCIPLE; SEARCHING SPACE;

COMPUTATIONAL COMPLEXITY;

EID: 33744777855     PISSN: 10093095     EISSN: None     Source Type: Journal    
DOI: 10.1631/jzus.2006.A0570     Document Type: Article

References (11)

1. Adamowicz, M., Albano, A., 1976. Nesting two dimensional shapes in rectangular modules. Computer-Aided Design, 8(1): 27-33. [doi:10.1016/0010-4485(76)90006-3]
2. Art, R.C., 1966. An Approach to the Two Dimensional Irregular Cutting Stock Problem. IBM Cambridge Scientific Centre, Report 36-Y08.
3. Bennell, J.A., Dowsland, K.A., Dowsland, W.B., 2001. The irregular cutting-stock problem-A new procedure for deriving the no-fit polygon. Computers and Operations Research, 28(3): 271-287. [doi:10.1016/S0305-0548(00)00021-6]
4. Davis, L., 1985. Job Shop Scheduling with Genetic Algorithm. Proceedings of the First International Conference on Genetic Algorithm, Lawrence Erlbaum Associates Publishers, p.136-140.
5. Dowsland, K.A., Dowsland, W.B., 1995. Solution approaches to irregular nesting problems. European Journal of Operational Research, 84(3): 506-521. [doi:10.1016/03772217(95)00019-M]
6. Fischer, A.D., Dagli, H., 2004. Employing subgroup evolution for irregular-shape nesting. Journal of Intelligent Manufacturing, 15(2): 187-199. [doi:10.1023/B:JIMS.0000018032.38317.f3]
7. Gomes, A.M., Oliveira, J.F., 2002. A 2-exchange heuristic for nesting problems. European Journal of Operational Research, 141(2): 359-370. [doi:10.1016/S0377-2217(02)00130-3]
8. Grinde, R.B., Cavalier, T.M., 1995. A new algorithm for the minimal-area convex enclosure problem. European Journal of Operational Research, 84(3): 522-538. [doi:10.1016/0377-2217(95)00020-Q]
9. Hopper, E., Turton, B.C.H., 2001. A review of the application of meta-heuristic algorithms to 2D strip nesting problems. Artificial Intelligence Review, 16(4): 257-300. [doi:10.1023/A:1012590107280]
10. Jakobs, S., 1996. On genetic algorithms for the nesting of polygons. European Journal of Operational Research, 88(1): 165-181. [doi:10.1016/0377-2217(94)00166-9]
11. Tay, F.E.H., Chong, T.Y., Lee, F.C., 2002. Pattern nesting on irregular-shaped stock using genetic algorithms. Engineering Applications of Artificial Intelligence, 15(6): 551-558. [doi:10.1016/S0952-1976(03)00009-5]