WEKO3
アイテム
レクトリニア多角形配置問題に対する高速な構築型解法
https://ipsj.ixsq.nii.ac.jp/records/85810
https://ipsj.ixsq.nii.ac.jp/records/85810bccaca55-22f4-45de-8079-c86d331c3150
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-AL12141006.pdf (442.7 kB)
|
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-09-27 | |||||||
| タイトル | ||||||||
| タイトル | レクトリニア多角形配置問題に対する高速な構築型解法 | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University | ||||||||
| 著者名 |
胡艶楠
× 胡艶楠
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container, where a rectilinear block is a polygonal block whose interior angle is either 90° or 270°. There exist many applications of this problem. In this paper, we propose a new construction heuristic algorithm based on the bottom-left strategy. The proposed algorithm is tested on a series of instances, which are generated from nine benchmark instances. The computational results show that the proposed algorithm is especially effective for large instances of the rectilinear block packing problem. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container, where a rectilinear block is a polygonal block whose interior angle is either 90° or 270°. There exist many applications of this problem. In this paper, we propose a new construction heuristic algorithm based on the bottom-left strategy. The proposed algorithm is tested on a series of instances, which are generated from nine benchmark instances. The computational results show that the proposed algorithm is especially effective for large instances of the rectilinear block packing problem. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN1009593X | |||||||
| 書誌情報 |
研究報告アルゴリズム（AL） 巻 2012-AL-141, 号 6, p. 1-6, 発行日 2012-09-27 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
