%0 Journal Article
%T Sequence Triplet Method for 3D Rectangle Packing Problem<br>三维矩形块布局的序列三元组编码方法
%A LU Yi-ping
%A ZHA Jian-zhong
%A <br>陆一平
%A 查建中
%J 软件学报
%D 2002
%I 
%X The sequence-pair method is a sufficient and finite (P-admissible) coding method for solution space representation of 2D rectangle packing problem, and is proved from a graphical demonstration called Gridding Procedure. Inspired by the 2D sequence-pair method, there should also be sequence-triplet method for 3D rectangle packing problem. But in 3D space, the gridding procedure is difficult to be realized. In this paper, a way is introduced to achieve the sequence-triplet method for 3D rectangle packing problem by analysis and deduction of matrix representation of sequence and partial sequence. This sequence-triplet coding method is P-admissible.
%K packing
%K sequence
%K coding
%K simulated annealing<br>布局
%K 序列
%K 编码
%K 模拟退火
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=6EBEAF5EEF0A3B2D&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=708DD6B15D2464E8&sid=C7323805325ABBEB&eid=5BE42E3678D12170&journal_id=1000-9825&journal_name=软件学报&referenced_num=10&reference_num=9