首页 | 官方网站   微博 | 高级检索  
     

矩形件优化排样问题的混合遗传算法求解
引用本文:韩喜君,丁根宏.矩形件优化排样问题的混合遗传算法求解[J].微机发展,2006,16(6):219-221.
作者姓名:韩喜君  丁根宏
作者单位:河海大学理学院 江苏南京210098
摘    要:利用遗传算法结合剩余矩形排样法求解矩形件正交排样问题。通过遗传算法将矩形件正交排样问题转化为一个排列问题,并引入剩余矩形排样算法来惟一确定每一个排列所对应的排样图(即排样方案),两者结合用于求解矩形件排样问题。最后用此混合遗传算法对文献1]中的两个算例进行了验证,表明了其有效性。

关 键 词:正交排样  排样方案  剩余矩形  遗传算法
文章编号:1673-629X(2006)06-0219-03
修稿时间:2005年11月11

Solving the Packing Problem of Rectangles with Hybrid Genetic Algorithm
HAN Xi-jun,DING Gen-hong.Solving the Packing Problem of Rectangles with Hybrid Genetic Algorithm[J].Microcomputer Development,2006,16(6):219-221.
Authors:HAN Xi-jun  DING Gen-hong
Abstract:The genetic algorithm and the surplus rectangle algorithm are used for solving the orthogonal packing problem of rectangles in this paper.First,the rectangles packing problem is turned into a permutation problem.Second,a surplus rectangle algorithm is introduced to decode the permutation of rectangles to the corresponding packing pattern uniquely.Thus,a new hybrid genetic algorithm is formed to solve this packing problem.At the end of this paper,the new genetic algorithm is validated by two examples,and the fact shows that the new algorithm presented by this paper is efficacious.
Keywords:orthogonal packing  packing pattern  surplus rectangle  genetic algorithm
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号