基于粒子群算法的矩形件优化排样  

The rectangular parts optimal layout based on the particle swarm optimization

作　　者：李明[1,2] 周泽魁[1] 

机构地区：[1]浙江大学控制科学与工程系,工业控制技术国家重点实验室,浙江杭州310027 [2]浙江省计量科学研究院

出　　处：《电路与系统学报》2007年第2期39-42,共4页Journal of Circuits and Systems

摘　　要：针对矩形件排样问题,提出了一种应用粒子群算法优化求解的方法。该方法首先将矩形件的排样问题转化为适于优化的排列问题,然后用粒子群优化算法对整个解空间进行高效搜索,在进化计算过程中应用了自适应调整规则,最终可获得全局最优的排样结果。排样实例表明,该优化排样算法行之有效,具有广泛的适应性。A rectangular optimal layout method using particle swarm optimization is proposed. The problems of rectangular optimal layout can be translated into optimization problem in the field of arrangement problem, and then the particle swarm optimization algorithm with the self-adaptive modulate regulation is used to search the solution space efficiently in order to find the optimal solution of the layout. The feasibility of the proposed method is demonstrated by the layout example.

关 键 词：矩形件 优化排样 粒子群优化 自适应 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]