Dissertations, 2001 and previous years; Entered 7/27/01 / DB reference years
PREV and NEXT link to numerically adjacent references for this DATABASE UPDATE.
CONTENTS links to the title list for this UPDATE's references.
Author Yowell, Jess Leon
Source Dissert; Degree: M.Eng. Year: 1999 Institution: University of Louisville;
Abstract: Ikonen et. al. (97) have developed a genetic algorithm (GA) for three-dimensional bin packing in a rapid prototyping (RP) build cylinder. The algorithm, known as GARP, creates a suitable packing scheme by evaluating the CAD files of the parts to be packed. The algorithm's evaluation is based primarily upon part and cylinder intersections; the final result being a packing scheme completely contained within the build cylinder and free of intersecting parts. GARP though does not take into account the later removal of the parts from the build cylinder. A part may be packed inside another hollow part or placed in an orientation that is impossible to remove without destroying the part. Therefore, before GARP can effectively and reliably construct packing schemes a complimentary algorithm must be devised to ensure that the assembly may be completely unpacked without damaging, or destroying, any of the parts.
This complementary algorithm would ensure that a packing scheme may be completely and non-destructively disassembled. In order to do this the algorithm must be able to virtually disassemble any generic packing scheme, rank packs on their ease of disassembly, and recognize packing schemes that can not be disassembled. Working in tandem with a bin-packing algorithm such as GARP, a companion disassembly algorithm can only increase the efficiency of such rapid manufacturing technology. XX