| 基于离散粒子群算法的矩形件优化排样 |
| |
| 引用本文： | 梁军,王强,程灿,常棠棠.基于离散粒子群算法的矩形件优化排样[J].计算机工程与设计,2007,28(22):5359-5361,5510. |
| |
| 作者姓名： | 梁军 王强 程灿 常棠棠 |
| |
| 作者单位： | 广西师范大学计算机科学与信息工程学院 广西桂林541004 |
| |
| 摘 要： | 目前,粒子群算法在连续问题优化上的应用已经很广泛,然而在离散问题优化方面仍处在尝试阶段.提出了一种改进粒子群算法来解决矩形件排样优化问题(离散优化问题).该算法融合了遗传算法中的交叉和变异思想,采用了信息交流策略,使其达到快速优化目的.算法也对"最低水平线法"解码方式进行了改进.实验结果表明,该算法具有快速,高效特点,与现有同类算法比较,在解决矩形件排样问题方面的优势明显.
|
| 关 键 词： | 矩形件排样 离散 粒子群算法 遗传算法 进化计算 离散粒子群算法 矩形件优化排样 particle swarm optimization discrete based packing 优势 排样问题 算法比较 快速优化 结果 实验 改进粒子群算法 解码 线法 水平 交流策略 信息 思想 交叉和变异 |
| 文章编号： | 1000-7024（2007）22-5359-03 |
| 收稿时间： | 2007-05-29 |
| 修稿时间： | 2007年5月29日 |
Optimum packing of rectangles based on discrete particle swarm optimization |
| |
| LIANG Jun,WANG Qiang,CHENG Can,CHANG Tang-tang.Optimum packing of rectangles based on discrete particle swarm optimization[J].Computer Engineering and Design,2007,28(22):5359-5361,5510. |
| |
| Authors: | LIANG Jun WANG Qiang CHENG Can CHANG Tang-tang |
| |
| Abstract: | At present,particle swarm optimization algorithm(PSO) has been applied to continued problems for several years,but it is still an attempt to use the algorithm in discrete problems.An improved particle swarm optimization algorithm is proposed to solve the packing problem of rectangles,which belongs to discrete problems.This algorithm combines the crossover and mutation in genetic algorithm and it is based on the information communication strategy in order to speed the optimization process.The mode of decoding based on 'the lowest horizontal line' is also modified.The experimental results show that this algorithm is promising and more efficient than other algorithms in solving the packing problem of rectangles. |
| |
| Keywords: | optimum packing of rectangles discrete particle swarm optimization genetic algorithm evolutionary computation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
