基于改进遗传禁忌搜索混合算法的二维矩形件排样问题研究
Research on Two-Dimensional Rectangular Part Layout Problem Based on Improved Genetic Tabu Search Hybrid Algorithm
摘要: 矩形件排样问题在实际生产中占据着很大的份额。本文主要针对矩形件排样问题中的零件定序问题进行研究。并基于此提出了自适应遗传禁忌搜索算法的序列优化方法,以此来提高矩形件的板材利用率。此算法以遗传算法为全局搜索算法,并通过自适应确定选择、交叉、变异算子的方式对其进行了改进。同时,采用禁忌搜索算法对已经进入收敛稳定阶段的种群进行局部搜索。通过此种方法来找到排样最优序列。实验结果表明:遗传禁忌搜索混合算法在提高板材利用率方面具有很好的效果。
Abstract: The layout problem of rectangular parts occupies a large proportion in actual production. In this paper, the problem of part sequencing in rectangular part layout is studied. Based on this, a sequence optimization method of adaptive genetic tabu search algorithm is proposed to improve the utilization rate of rectangular plates. This algorithm takes genetic algorithm as the global search algorithm, and improves it by adaptively determining the selection, crossover and mutation operators. At the same time, the tabu search algorithm is used to locally search the population that has entered the stage of convergence and stability. This method is used to find the optimal nesting sequence. The experimental results show that the hybrid algorithm of genetic tabu search has a good effect in improving the utilization rate of plates.
文章引用:徐鑫, 周律. 基于改进遗传禁忌搜索混合算法的二维矩形件排样问题研究[J]. 运筹与模糊学, 2023, 13(2): 581-592. https://doi.org/10.12677/ORF.2023.132058

参考文献

[1] 扈少华, 潘立武. 矩形件五级剪切排样方式的一种生成算法[J]. 锻压技术, 2018, 43(10): 190-194.
[2] Leung, S.C.H., Zhang, D. and Sim, K.M. (2011) A Two-Stage Intelligent Search Algorithm for the Two-Dimensional Strip Packing Problem. European Journal of Operational Research, 215, 57-69. [Google Scholar] [CrossRef
[3] Charalambous, C. and Fleszar, K. (2011) A Constructive Bin-Oriented Heuristic for the Two-Dimensional Binpacking Problem with Guillotine Cuts. Computers & Operations Research, 38, 1443-1451. [Google Scholar] [CrossRef
[4] López-Camacho, E., Terashima-Marín, H., Ochoa, G., et al. (2013) Understanding the Structure of Bin Packing Problems through Principal Component Analysis. International Journal of Production Economics, 145, 488-499. [Google Scholar] [CrossRef
[5] Ayadi, O., Masmoudi, M., Ameur, M.B. and Masmoudi, F. (2017) A New PSO-Based Algorithm for Two-Dimensional Non-Guillotine Non-Oriented Cutting Stock Problem. Applied Artificial Intelligence, 31, 376-393. [Google Scholar] [CrossRef
[6] 郭蕴华, 许昆仑, 常万里, 牟军敏. 基于改进蚁群算法和剩余矩形法的二维矩形件优化排样[J]. 武汉理工大学学报, 2018, 40(2): 95-100.
[7] Jakobs, S. (1996) On Genetic Algorithms for the Packing of Polygons. European Journal of Operational Research, 88, 165-181. [Google Scholar] [CrossRef
[8] Holland, J.H. (2000) Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions. Evolutionary Computation, 8, 373-391. [Google Scholar] [CrossRef] [PubMed]
[9] 刘胡瑶. 基于临界多边形的二维排样算法研究[D]: [博士学位论文]. 上海: 上海交通大学, 2007.
[10] Glover, F. (1989) Tabu Search—Part I. ORSA Journal on Computing, 1, 190-206. [Google Scholar] [CrossRef
[11] Glover, F. (1990) Tabu Search—Part II. ORSA Journal on Computing, 2, 4-32. [Google Scholar] [CrossRef