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
Masalah pembungkusan tiga dimensi (3D) adalah untuk menyusun kotak segi empat tepat yang diberikan dalam kotak segi empat tepat isipadu minimum tanpa bertindih antara satu sama lain. Sebagai pendekatan, kertas kerja ini memperkenalkan sistem tiga jujukan label kotak, jujukan tiga kali ganda, untuk mengekod topologi pembungkusan 3D. Topologi ialah sistem perhubungan relatif dalam pasangan kotak seperti kanan, atas, hadapan, dll. Ia akan dibuktikan bahawa jujukan-tiga tiga mewakili topologi pembungkusan 3D yang boleh dikesan iaitu pembungkusan 3D supaya terdapat susunan kotak di mana semua kotak diekstrak satu demi satu ke arah tetap tertentu tanpa mengganggu kotak lain yang tinggal. Idea ini diperluaskan kepada sistem lima jujukan tertib, jujukan-kuwintupel. Peraturan penyahkodan diberikan yang mana mana-mana pembungkusan 3D diwakili. Sistem pengekodan ini digunakan untuk mereka bentuk algoritma heuristik dengan penyepuhlindapan simulasi yang mencari kod untuk pembungkusan 3D yang lebih baik. Keputusan eksperimen sangat meyakinkan kegunaannya sebagai algoritma pembungkusan automatik.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -