The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
O problema de empacotamento tridimensional (3D) consiste em organizar determinadas caixas retangulares em uma caixa retangular de volume mínimo, sem se sobreporem. Como abordagem, este artigo apresenta o sistema de três sequências de rótulos de caixa, a sequência tripla, para codificar a topologia do empacotamento 3D. A topologia é o sistema de relações relativas em pares de caixas, como à direita, acima, na frente, etc. Será provado que a sequência tripla representa a topologia dos empacotamentos 3D tratáveis, que é um empacotamento 3D de modo que haja uma ordem das caixas ao longo da qual todas as caixas são extraídas uma a uma em uma determinada direção fixa, sem perturbar as outras caixas restantes. A ideia se estende ao sistema de cinco sequências ordenadas, a sequência-quíntupla. É fornecida uma regra de decodificação pela qual qualquer empacotamento 3D é representado. Esses sistemas de codificação são aplicados para projetar algoritmos heurísticos por recozimento simulado que buscam nos códigos melhores empacotamentos 3D. Os resultados experimentais foram muito convincentes sobre sua utilidade como algoritmos de empacotamento automatizados.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hiroyuki YAMAZAKI, Keishi SAKANUSHI, Shigetoshi NAKATAKE, Yoji KAJITANI, "The 3D-Packing by Meta Data Structure and Packing Heuristics" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 4, pp. 639-645, April 2000, doi: .
Abstract: The three dimensional (3D) packing problem is to arrange given rectangular boxes in a rectangular box of the minimum volume without overlapping each other. As an approach, this paper introduces the system of three sequences of the box labels, the sequence-triple, to encode the topology of the 3D-packing. The topology is the system of relative relations in pairs of boxes such as right-of, above, front-of, etc. It will be proved that the sequence-triple represents the topology of the tractable 3D-packings which is a 3D-packing such that there is an order of the boxes along which all the boxes are extracted one by one in a certain fixed direction without disturbing other remaining boxes. The idea is extended to the system of five ordered sequences, the sequence-quintuple. A decoding rule is given by which any 3D-packing is represented. These coding systems are applied to design heuristic algorithms by simulated annealing which search the codes for better 3D-packings. Experimental results were very convincing its usefulness as automated packing algorithms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_4_639/_p
Copiar
@ARTICLE{e83-a_4_639,
author={Hiroyuki YAMAZAKI, Keishi SAKANUSHI, Shigetoshi NAKATAKE, Yoji KAJITANI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The 3D-Packing by Meta Data Structure and Packing Heuristics},
year={2000},
volume={E83-A},
number={4},
pages={639-645},
abstract={The three dimensional (3D) packing problem is to arrange given rectangular boxes in a rectangular box of the minimum volume without overlapping each other. As an approach, this paper introduces the system of three sequences of the box labels, the sequence-triple, to encode the topology of the 3D-packing. The topology is the system of relative relations in pairs of boxes such as right-of, above, front-of, etc. It will be proved that the sequence-triple represents the topology of the tractable 3D-packings which is a 3D-packing such that there is an order of the boxes along which all the boxes are extracted one by one in a certain fixed direction without disturbing other remaining boxes. The idea is extended to the system of five ordered sequences, the sequence-quintuple. A decoding rule is given by which any 3D-packing is represented. These coding systems are applied to design heuristic algorithms by simulated annealing which search the codes for better 3D-packings. Experimental results were very convincing its usefulness as automated packing algorithms.},
keywords={},
doi={},
ISSN={},
month={April},}
Copiar
TY - JOUR
TI - The 3D-Packing by Meta Data Structure and Packing Heuristics
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 639
EP - 645
AU - Hiroyuki YAMAZAKI
AU - Keishi SAKANUSHI
AU - Shigetoshi NAKATAKE
AU - Yoji KAJITANI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2000
AB - The three dimensional (3D) packing problem is to arrange given rectangular boxes in a rectangular box of the minimum volume without overlapping each other. As an approach, this paper introduces the system of three sequences of the box labels, the sequence-triple, to encode the topology of the 3D-packing. The topology is the system of relative relations in pairs of boxes such as right-of, above, front-of, etc. It will be proved that the sequence-triple represents the topology of the tractable 3D-packings which is a 3D-packing such that there is an order of the boxes along which all the boxes are extracted one by one in a certain fixed direction without disturbing other remaining boxes. The idea is extended to the system of five ordered sequences, the sequence-quintuple. A decoding rule is given by which any 3D-packing is represented. These coding systems are applied to design heuristic algorithms by simulated annealing which search the codes for better 3D-packings. Experimental results were very convincing its usefulness as automated packing algorithms.
ER -