A Tree Based Novel Representation for 3D-Block Packing

A Tree Based Novel Representation for 3D-Block Packing

The 3D packing problem consists of arranging nonoverlapping rectangular boxes (blocks) of given sizes in a rectangular box of minimum volume. As a representation of 3D packings, this paper proposes a novel encoding method called Double Tree and Sequence (DTS). The following are features of DTS: 1) I...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 2009-05, Vol.28 (5), p.759-764
Hauptverfasser: Fujiyoshi, K., Kawai, H., Ishihara, K.
Format: Artikel
Sprache:eng
Schlagworte:
3D packing
Agricultural engineering
Agriculture
Circuits and systems
Computer aided design
Decoding
Design engineering
Double tree and sequence (DTS)
Encoding
Field programmable gate arrays
Integrated circuit technology
Integrated circuits
O-tree
rectangular box
Representations
Simulated annealing
Solution space
Stochastic processes
Three dimensional
tree
Trees
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The 3D packing problem consists of arranging nonoverlapping rectangular boxes (blocks) of given sizes in a rectangular box of minimum volume. As a representation of 3D packings, this paper proposes a novel encoding method called Double Tree and Sequence (DTS). The following are features of DTS: 1) It can represent any minimal packing. 2) It can be decoded into the corresponding 3D packing in O ( n 2 ) time, where n is the number of rectangular boxes. 3) The size of the solution space (the number of codes) of DTS is significantly smaller than any conventional representation that can represent any packing. Experimental comparisons with conventional representations indicate the superiority of the proposed representation DTS.
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2009.2015424