An experimental analysis of deepest bottom-left-fill packing methods for additive manufacturing

摘要

The adoption of Additive Manufacturing (AM) technology requires the efficient utilisation of the avail- able build volumes to minimise production times and costs. Three-dimensional algorithms, particularly the Deepest Bottom-Left-Fill (DBLF) heuristic, have been extensively used to tackle the problem of packing arbitrary 3D geometries within the AM sector. A particularly common method applied to more realistic packing problems is the combination of DBLF and metaheuristics such as Genetic Algorithms (GAs). Through a series of experiments, this paper experimentally investigates the practical aspects, and comparative performance of different DBLF based methods including a brute force algorithm and GA combined with DBLF for AM build volume packing. The insights into the relationship between algorithm efficiency (in terms of volume utilisation), simulation runtime, and practical requirements, in particular geometry rotation constraints are investigated. In addition to providing an increased comprehension of the practical aspects of applying DBLF algorithms in the AM context, this study confirms the limita- tions of traditional DBLF and the requirements for more flexible and intelligent placement strategies while experimentally demonstrating that higher degrees of freedom for part rotation contribute to small improvements in volume density. The resulting additional computational effort discourages this strategy, however.