2013年7月
Efficient Construction Heuristic Algorithms for the Rectilinear Block Packing Problem
Proc. International Symposium on Scheduling
- ,
- ,
- ,
- 巻
- 13
- 号
- 202
- 開始ページ
- 80
- 終了ページ
- 85
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- 出版者・発行元
- 日本機械学会
The rectilinear block packing problem involves 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°. This problem is relevant for many applications, such as VLSI design, timber/glass cutting, and newspaper layout. In this paper, we design efficient implementations of two construction heuristic algorithms for rectilinear block packing. The proposed algorithms are tested on a series of instances that are generated from nine benchmark instances. The computational results show that the proposed algorithms are especially efficient for large instances.
- リンク情報
- ID情報
-
- CiNii Articles ID : 110009955587
- CiNii Books ID : AA11901544