首页|基于改进粒子群算法的木材板材下料方法

基于改进粒子群算法的木材板材下料方法

扫码查看
木材板材在家具行业应用广泛,以绿色环保、节约能源为 目的的木材板材优化下料已经成为研究的热点。木材板材下料优化问题属于二维矩形下料问题,是一种具有高度计算复杂性的问题。本研究主要针对单规格木材板材进行矩形零件下料问题,在木材板材长和宽都大于零件长和宽的情况下,通过建立二维下料的数学模型,采用标准粒子群算法、变邻域搜索算法、粒子群混合变邻域搜索算法分别进行求解,并以某企业的下料实例进行分析计算。首先,利用标准粒子群算法求解单规格板材下料问题;其次,利用变邻域搜索算法求解单规格板材下料问题。在获得局部最优解的基础上改变其邻域结构再进行局部搜索,找到另一个局部最优解,如此不断迭代,直到满足算法的终止条件,获得全局最优解;最后,利用粒子群变邻域搜索混合算法求解单规格板材下料问题。针对粒子群算法局部搜索能力较差、容易过早收敛的问题和具有较好包容性的特点,将变邻域搜索的思想融入粒子群算法中,使结果更加趋向全局最优。结果表明:粒子群变邻域搜索混合算法相比粒子群算法和变邻域算法效率都有显著提升,能显著提高该木材板材的利用率,增加企业经济效益。
Research on cutting method of wood panels based on improved particle swarm algorithm
Wood-based panels is widely used in the furniture industry and the research on optimized cutting patterns for saving materials and energy has become a scientific research hotspot.The cutting patterns of wood panels have re-ceived increasing attention.At present,many furniture companies still use manual cutting pattern to produce furniture panel parts,which often takes a long time and causes serious waste of materials.Due to the diversity of customer needs,it is necessary to arrange a reasonable cutting plan to make full use of the wood-based panels,improving the economic efficiency of the enterprise and save natural resources.The optimization of the panel sawing pattern is a two-dimensional rectangular blanking problem with high computational complexity.This study mainly focused on the blan-king of rectangular parts for single-size wood-based panels.In the case that the length and width of panels were greater than the length and width of parts,the standard particle swarm optimization(PSO)algorithm,variable neighborhood search algorithm and particle swarm optimization(PSO)hybrid variable neighborhood search algorithm were used to solve the problem by establishing a two-dimensional mathematical model of blanking.Cutting examples were analyzed and calculated based on the data collected from several furniture enterprises.Firstly,the standard particle swarm algo-rithm was used to solve the single-size panel blanking problem.Secondly,the variable neighborhood search algorithm was used to solve the single-size panel blanking problem.To obtain the local optimal solution,the neighborhood struc-ture was changed,and then local search was performed to find new local optimal solution.This process was repeated until the termination condition of the algorithm was met.Finally,the particle swarm variable neighborhood search hy-brid algorithm was used to solve the single-size plank blanking problem.Because the particle swarm algorithm has the drawbacks of poor localization ability,premature convergence and large tolerance,the idea of variable neighborhood search was integrated into the particle swarm algorithm to make the result closer to the global optimum.The results showed that,compared with the particle swarm optimization(PSO)and variable neighborhood search algorithm,the hybrid algorithm of the particle swarm optimization(PSO)significantly improved the utilization rate of wood-based panels for the furniture enterprises,enhancing the economic benefits for these enterprises.

wood panelstwo-dimensional rectangular blanking problemparticle swarm algorithmvariable neighbor-hood search algorithmparticle swarm hybrid variable neighborhood search algorithm

黄秀玲、陶泽、尤华政、李宸、刘俊

展开 >

南京林业大学机械电子工程学院,南京 210037

木材板材 二维矩形下料问题 粒子群算法 变邻域搜索算法 粒子群混合变邻域搜索算法

江苏省科协调研项目

2019004

2024

林业工程学报
南京林业大学

林业工程学报

CSTPCD北大核心
影响因子:0.742
ISSN:2096-1359
年,卷(期):2024.9(1)
  • 4