.png){kind=icon}
返回
Using pattern matching for tiling and packing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.02.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be considered as a special case of bin packing. In the proposed method, the representation of the figures and the board is based on directional chain codes. Contrary to other works that the area has been used for the board and the figures, the proposed method is based on usage of their boundaries instead. With this representation, consideration of the area has been replaced with that of the exact string matching. With the proposed knowledge representation, rotation and reflection of the figures can be considered easily. The results of a hybrid approach of genetic algorithm and simulated annealing have been shown. This new method, introduces a novel approach for handling and solving a variety of 2D-packing problems. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
tiling
direction code
pattern matching
string matching
2D cutting and packing
genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Adaptive Hysteresis Comparison Control of Load Sharing for Three-Phase Interleaved SCC-LLC Converter
PREAI
分享收藏 没有更多内容
没有更多内容