Research indexJournal article
Dropping method for rectangle packing problem
Takahashi
1 Jan 2000
NobleIDark:/48914/w1/20261004/ED2FE369DOI10.1109/iscas.2000.857062
Dropping method for rectangle packing problem
Takahashi · 2000 · Subscription
NobleIDark:/48914/w1/20261004/ED2FE369DOI10.1109/iscas.2000.857062
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors determining the efficiency of algorithms. SEQ-PAIR is one of the most sophisticated encoding scheme, which has been considered to have a small solution space. In this paper, we begin with a packing procedure that does not look so smart. This procedure, however, leads us to another encoding scheme DS (the abbreviation for Dropping Schedule) whose solution space has the same size as that of SEQ-PAIR. Moreover, we introduce encoding scheme LOT as an advanced version of DS, which has a smaller solution space.