融合深度强化学习与遗传算法的二维不规则零件排样方法
摘要
融合深度学习与改进遗传算法的混合优化方法。该算法采用多角度旋转策略与自适应遗传算子,并结合深度学习模
型进行布局质量评估。通过在线学习机制实现算法的自优化。通过融合最近多边形拟合(NFP)算法的几何精度与
卷积神经网络(CNN)的预测能力,本方法可获得高效优质的排样方案。采用标准不规则测试案例进行实验验证,
证明了本算法的优化有效性。实验结果表明,所提方法能有效实现二维不规则零件排样,并具有优异的优化性能。
关键词
全文:
PDF参考
[1]Bennell J A, Oliveira J F. The geometry of nesting
problems: A tutorial[J]. European Journal of Operational
Research, 2008, 184(2): 397-415.
[2]Festa P. A brief introduction to exact, approximation,
and heuristic algorithms for solving hard combinatorial
optimization problems.In:Proceedings of the 16th
International Conference on Transparent Optical Networks
(ICTON). Graz, Austria: IEEE, 2014. 1-20.
[3]Williamson D P, Shmoys D B. The Design of
Approximation Algorithms. Cambridge: Cambridge
University Press, 2011.
[4]Vazirani V V. Approximation Algorithms. Berlin,
Heidelberg: Springer, 2003.
[5]Hochba D S. Approximation algorithms for NP-hard
problems. ACM Sigact News, 1997, 28(2): 40-52
[6]Vinyals, O., Fortunato, M., & Jaitly, N. (2015).
Pointer networks. Advances in Neural Information Processing
Systems, 28.
[7]Bello, I., Pham, H., Le, Q. V., Norouzi, M., &
Bengio, S. (2016). Neural combinatorial optimization with
reinforcement learning. arXiv preprint arXiv:1611.09940.
[8]曾焕荣,商慧亮.基于深度强化学习的二维不规
则多边形排样方法[J].计算机系统应用,2022,31(2):
168-175.
[9]Albano A,Sapuppo G. Optimal allocation
of twodimensional irregular shapes using heuristic
search methods. IEEE Transactions on Systems, Man,
and Cybernetics,1980,10(5):242-248.[doi:10.1109/
TSMC.1980.4308483]
[10]Pinheiro P R, Amaro Júnior B, Saraiva R D. A
Random-Key Genetic Algorithm for Solving the Nesting
Problem[J]. International Journal of Computer Integrated
Manufacturing, 2016, 29(11): 1159-1165.
Refbacks
- 当前没有refback。
