一种不规则零件排样的快速解码算法  

A Rapid Decoding Algorithm of Irregular Parts Packing

作　　者：洪灵[1] 王耘[1] 

机构地区：[1]浙江大学动力机械与车辆工程研究所,杭州310027

出　　处：《计算机辅助设计与图形学学报》2005年第11期2465-2470,共6页Journal of Computer-Aided Design & Computer Graphics

摘　　要：设计了一种应用于不规则零件排样的快速解码算法,首先平行线化零件和板料,然后采用左下角(Bottom-Left-condition,BL)策略驱动零件在板料上向x和y2个方向移动,引入零件之间的顶点碰撞特性,以加快获得零件在x方向上的定位坐标;提出板料基线提高策略,以加快获得零件在y方向上的定位坐标.实验表明,该算法解码速度快,易于实现.This paper describes a rapid decoding algorithm of nesting irregular-shaped parts on irregular-shaped stock. By the algorithm, first, we arrange the parts and stock in parallel, then use BL strategy to pack the parts on the stock. In the algorithm, the vertex collision is introduced to get the part＇s position along x coordinate rapidly, and a strategy of stock-baseline increasing is proposed to get the part＇s position along y coordinate. The results show that this algorithm is efficient and easy for implementation.

关 键 词：排样 解码 遗传算法 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]