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

一种矩形件布局问题的求解方法
引用本文:李捷.一种矩形件布局问题的求解方法[J].适用技术之窗,2008(1):22-24.
作者姓名:李捷
作者单位:南昌大学信息工程学院,江西南昌330000
摘    要:布局问题来源于生产实际,在提高板材利用率以节约原材料,降低成本,提高经济效益,对各行业均有重要意义。针对遗传算法在矩形件布局问题中的实际特点,并分析了矩形件布局给定排放顺序的排放算法,并提出了一种新的排放算法——最低水平线旋转搜索法,并将这种算法和遗传算法结合应用于矩形件布局问题的求解。计算实例表明这种新的排放算法可以和遗传蚁群算法有效的结合。

关 键 词:矩形件布局  遗传算法  蚂蚁算法  融合  最低水平线旋转搜索法

an Algorithm for Rectangular Packing Problem
Li Jie.an Algorithm for Rectangular Packing Problem[J].Science & Technology Plaza,2008(1):22-24.
Authors:Li Jie
Affiliation:Li Jie(School of Information Engineering, Nanchang University; Jiangxi Nanchang 330000)
Abstract:Rectanglular packing problem is coming from actual manufacture,it is important for industries to increase the material utility and economic income.On the basis of the Lowest Horizontal Line Search Algorithm,an improved algorithm for rectangular packing problem is proposed in this paper,that is,Lowest Horizontal Line-Rotate Searching Algorithm,which meets the BL condition and overcome the shortcomings of other algorithm for some patterns.The simulation results show that very nice effects are obtained.
Keywords:Rectangular Packing Problem  Genetic Algorithm  Ant Algorithm  Combination  Lowest Horizontal Line-Rotate Searching Algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号