A 3D printing nesting algorithm with dynamic collision constraints
提出一种嵌套算法，支持并发和顺序打印模式，通过无拟合多边形和二维层投影避免碰撞，显著减少批次、浪费和制造时间，提升零件质量。
Additive Layer Manufacturing, particularly Fused Deposition Modelling, faces significant batch loss risks during production. The traditional Concurrent Printing Mode produces all parts simultaneously (layer-by-layer, bottom-to-top), efficiently using printing space but risking complete batch failure if problems occur. In contrast, Sequential Printing Mode produces one part at a time, reducing the risk of total batch loss but utilising printing space less efficiently. In this work, we propose an algorithm that, given a set of parts, performs the nesting of the parts for Concurrent Printing Mode, and for the first time, for the Sequential Printing Mode. A no-fit polygon based approach is used to handle geometry between pairs of parts by using multiple horizontal 2D layer projections of 3D parts, to ensure non-overlapping constraints and prevent machine-part collisions. A Greedy Randomized Adaptive Search Procedure is proposed, tested and benchmarked against a commercial software, using a new set of real-world instances. The approach shows the ability to find high-quality solutions. The approach significantly reduces the number of batches, minimises waste, reduces manufacturing time, and promotes parts quality.