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

DOI10.1631/jzus.2006.A0570zbMath1166.90377OpenAlexW2029146252MaRDI QIDQ2508197

Huyao Liu, Yuan-Jun He

Publication date: 9 October 2006

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1631/jzus.2006.a0570

zbMATH Keywords

Cutting stockGenetic algorithm (GA)NestingLowest gravity centerNo Fit Polygon (NFP)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• TOPOS

Cites Work

• Solution approaches to irregular nesting problems
• A new algorithm for the minimal-area convex enclosure problem
• On genetic algorithms for the packing of polygons
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A 2-exchange heuristic for nesting problems
• Unnamed Item

This page was built for publication: Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle