| Presentation | 2017-12-15 A faster searching method for polyhedral packing problem Yutaka Matsushita, Kunihiro Fujiyoshi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Polyhedral packing problem is to pack given polyhedrons consisting of only planes perpendicular to one of x, y or z in a rectangular box of the minimum volume without overlapping each other. Polyhedral packing represented by Sequence-Quintuple, which is a representation of rectangular box packing, was proposed by using a technique to extend rectangle packing to rectilinear polygon packing. However, solution space includes a lot of SQs with no corresponding packing(infeasible), so that it takes a lot of time to search the solution space for good packing. By extending the method proposed for rectilinear packing to polyhedron, this paper proposes a method to judge quickly and a method to speed up the decode time of SQ. Experiments show the effectiveness of these proposed methods implemented with Simulated Annealing. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Polyhedral Packing / sequence-quintuple / sequence-pair / Rectilinear Packing / Simulated Annealing |
| Paper # | CAS2017-108,ICD2017-96,CPSY2017-105 |
| Date of Issue | 2017-12-07 (CAS, ICD, CPSY) |
| Conference Information | |
| Committee | ICD / CPSY / CAS |
|---|---|
| Conference Date | 2017/12/14(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Art Hotel Ishigakijima |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Hideto Hidaka(Renesas) / Koji Nakano(Hiroshima Univ.) / Mitsuru Hiraki(Renesas) |
| Vice Chair | Makoto Nagata(Kobe Univ.) / Hidetsugu Irie(Univ. of Tokyo) / Takashi Miyoshi(Fujitsu) / Hideaki Okazaki(Shonan Inst. of Tech.) |
| Secretary | Makoto Nagata(Univ. of Tokyo) / Hidetsugu Irie(Panasonic) / Takashi Miyoshi(Utsunomiya Univ.) / Hideaki Okazaki(Hokkaido Univ.) |
| Assistant | Masanori Natsui(Tohoku Univ.) / Masatoshi Tsuge(Socionext) / Hiroyuki Ito(Tokyo Inst. of Tech.) / Pham Konkuha(Univ. of Electro-Comm.) / Yasuaki Ito(Hiroshima Univ.) / Tomoaki Tsumura(Nagoya Inst. of Tech.) / Yohei Nakamura(Hitachi) |
| Paper Information | |
| Registration To | Technical Committee on Integrated Circuits and Devices / Technical Committee on Computer Systems / Technical Committee on Circuits and Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A faster searching method for polyhedral packing problem |
| Sub Title (in English) | |
| Keyword(1) | Polyhedral Packing |
| Keyword(2) | sequence-quintuple |
| Keyword(3) | sequence-pair |
| Keyword(4) | Rectilinear Packing |
| Keyword(5) | Simulated Annealing |
| 1st Author's Name | Yutaka Matsushita |
| 1st Author's Affiliation | Tokyo University of Agriculture and Technology(TUAT) |
| 2nd Author's Name | Kunihiro Fujiyoshi |
| 2nd Author's Affiliation | Tokyo University of Agriculture and Technology(TUAT) |
| Date | 2017-12-15 |
| Paper # | CAS2017-108,ICD2017-96,CPSY2017-105 |
| Volume (vol) | vol.117 |
| Number (no) | CAS-343,ICD-344,CPSY-345 |
| Page | pp.pp.181-186(CAS), pp.181-186(ICD), pp.181-186(CPSY), |
| #Pages | 6 |
| Date of Issue | 2017-12-07 (CAS, ICD, CPSY) |