矩形件三阶段带排样问题的遗传算法  

Genetic algorithm for rectangular three-stage strip packing problem

作　　者：刘睿[1] 严玄[2] 崔耀东[2] 

机构地区：[1]聊城大学计算机学院,山东聊城252000 [2]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《计算机工程与应用》2010年第33期221-224,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.60763011;广西科学基金项目(No.桂科自0728100);贵州省高层次人才科研条件特助基金项目~~

摘　　要：采用混合遗传算法求解矩形件带排样问题,采用三阶段排样方式以满足特定的约束或简化切割工艺。改进遗传算子,在变异操作之后使用调整操作,以进一步简化得到的排样方案。在初始种群构造时,根据矩形件的特性采用一些简单有效的方法,使结果更好更快地收敛。实验结果表明方法对解决这类问题是有效的。A hybrid genetic algorithm to solve the rectangular strip packing problem is proposed.Considering some special constraints and simplifying the cutting process,the idea of three-stage is adopted to design the improved algorithm.The genetic operation is improved and an adjustment operation is used to optimize the cutting plan after the mutation operation.In initial population construction some simple methods are used to make the results converge more quickly.The experiment results indicate the validity of the presented algorithm.

关 键 词：遗传算法 三阶段 矩形件带排样问题 

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