摘要
针对三维矩形布局问题进行了研究。在三元序列的基础上,结合布局物体的几何可行域,提出了三元序列结合几何可行域的布局算法。并且利用遗传算法对布局算法进行优化,得到了三元序列结合可行域布局遗传算法。分析和实例证明,三元序列结合几何可行域的改进算法有效地提高了布局效率。
This paper studies the three dimensional rectangular packing problem. On the basis of sequence triple, combined with geometry feasible region of packing items, the sequence triple and feasible region packing algorithm is proposed. Then the packing algorithm is optimized by genetic algorithm, the sequence triple and feasible region packing genetic algorithm is formed. Analysis and examples prove that the improved sequence triple and feasible region packing algorithm can effectively increase packing efficiency.
出处
《图学学报》
CSCD
北大核心
2014年第6期821-827,共7页
Journal of Graphics
基金
国家自然科学基金资助项目(60975046)
天津职业技术师范大学科研发展基金资助项目(KJ14-64)
关键词
布局问题
三元序列
可行域
遗传算法
packing problem
sequence triple
feasible region
genetic algorithm
