摘要
提出了一种基于离散粒子群优化算法求解矩形件排样问题的方法。文中介绍了基本粒子群优化的搜索策略与基本算法,用置换子和置换序列构造一种离散粒子群优化矩形件排样算法,通过实例和遗传算法相比较,实验结果表明该算法是有效的。
A discrete particle swarm algorithm for the rectangular strip packing problem is presented. It introduces the basic particle swarm algorithm and the search strategies, constructs a discrete particle swarm algorithm for the rectangular strip packing problem with swap operator and swap sequence. The algorithm is compared with two genetic algorithms, and the computational results indicate that the algorithm is efficient.
出处
《机械工程师》
2007年第1期86-88,共3页
Mechanical Engineer
基金
广西自然科学基金资助项目(0236017)
关键词
离散粒子群忧化算法
矩形件排样
最优解
discrete particle swarm optimization
rectangular strip packing problem
optimization
