电子学报2012，Vol.40Issue(6)：1103-1107,5.DOI:10.3969/j.issn.0372-2112.2012.06.006
一种求解矩形排样问题的遗传-离散粒子群优化算法
A Genetic-Discrete Paticle Swarm Optimization Algorithm for Rectangular Packing
摘要
Abstract
For the optimization problem of rectangular packing in manufacturing field, a genetic-discrete particle swarm optimization is proposed.Through introducing the concepts of exchange operator and exchange sequence, the difficult problem of describing the update particles in the standard particle swarm optimization algorithm for combinatorial optimization problem is solved. Combining the idea of mutation and crossover in genetic algorithm strengthens the diversity and stability of the particle swarm. An improved lowest horizontal search algorithm is proposed to accelerate the convergence speed and can be used to decode to packing layout. The experimental data show that the proposed algorithm is effective and robust in solving the problem of rectangular packing.关键词
离散粒子群优化/遗传算法/最低水平线搜索/矩形排样Key words
descrete partical swarm optimization/ genetic alogorighm/ lowest horizontal search algorithm/rectangular packing分类
信息技术与安全科学引用本文复制引用
黄岚,齐季,谭颖,杨滨..一种求解矩形排样问题的遗传-离散粒子群优化算法[J].电子学报,2012,40(6):1103-1107,5.基金项目
国家自然科学基金(No.60873146,No.60973092,No.60903097) （No.60873146,No.60973092,No.60903097）
“符号计算与知识工程”教育部重点实验室项目 （）
吉林省科技发展计划重点项目(No.20110354) （No.20110354）
