计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (33): 221-224.DOI: 10.3778/j.issn.1002-8331.2010.33.063

• 工程与应用 • 上一篇    下一篇

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

刘 睿1,严 玄2,崔耀东2   

  1. 1.聊城大学 计算机学院,山东 聊城 252000
    2.广西师范大学 计算机科学与信息工程学院,广西 桂林 541004
  • 收稿日期:2010-03-12 修回日期:2010-05-10 出版日期:2010-11-21 发布日期:2010-11-21
  • 通讯作者: 刘 睿

Genetic algorithm for rectangular three-stage strip packing problem

LIU Rui1,YAN Xuan2,CUI Yao-dong2   

  1. 1.School of Computer Science,Liaocheng University,Liaocheng,Shandong 252000,China
    2.College of Computer Science & Information Technology,Guangxi Normal University,Guilin,Guangxi 541004,China
  • Received:2010-03-12 Revised:2010-05-10 Online:2010-11-21 Published:2010-11-21
  • Contact: LIU Rui

摘要: 采用混合遗传算法求解矩形件带排样问题,采用三阶段排样方式以满足特定的约束或简化切割工艺。改进遗传算子,在变异操作之后使用调整操作,以进一步简化得到的排样方案。在初始种群构造时,根据矩形件的特性采用一些简单有效的方法,使结果更好更快地收敛。实验结果表明方法对解决这类问题是有效的。

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

Abstract: 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.

Key words: genetic algorithm, three-stage, rectangular strip packing problem

中图分类号: