Page 33 - 《软件学报》2021年第12期

阳名钢 等:求解二维装箱问题的强化学习启发式算法 3697

[27] Nazari M, Afshin O, Lawrence S, et al. Reinforcement learning for solving the vehicle routing problem. In: Proc. of the Advances
in Neural Information Processing Systems (NIPS), Vol. 31. 2018. 9839−9849.
[28] Kool W, Herke VH, Max W. Attention, learn to solve routing problems! arXiv preprint arXiv:1803. 08475, 2018.
[29] Hu HY, Zhang XD, Yan XW, et al. Solving a new 3D bin packing problem with deep reinforcement learning method. arXiv
preprint arXiv:1708. 05930, 2017.
[30] Bortfeldt A, Hermann G. New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. In:
Proc. of the 39th Annual Hawaii Int’l Conf. on System Sciences (HICSS 2006). IEEE, 2006. 30b.
[31] Wang PY, Christine LV. Data set generation for rectangular placement problems. European Journal of Operational Research,
2001,134(2):378−391.
[32] Belov G, Guntram S, Mukhacheva EA, et al. One-dimensional heuristics adapted for two-dimensional rectangular strip packing.
Journal of the Operational Research Society, 2008,59:823−832.
[33] Hopper E. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Cardiff: University of
Wales, 2000.
[34] Berkey JO, Wang PY. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 1987,38(5):
423−429.
[35] Martello S, Daniele V. Exact solution of the two-dimensional finite bin packing problem. Management Science, 1998,44(3):
388−399.
[36] Mumford-Valenzuela CL, Janis V, Wang PY. Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical
Study. Springer, 2004. 501−522.
[37] Leung SCH, Zhang DF. A fast layer-based heuristic for non-guillotine strip packing. Expert Systems with Applications, 2011,
38(10):13032−13042.
[38] Glorot A, Bengio Y. Understanding the difficulty of training deep feedforward neural networks. In: Proc. of the 13th Int’l Conf. on
Artificial Intelligence and Statistics, PMLR, 2010. 249−256.
[39] Chen MF. Research on hybrid heuristic algorithm for two-dimensional strip packing problem [MS. Thesis]. Xiamen: Xiamen
University, 2020 (in Chinese with English abstract).

附中文参考文献:
[8] 黄文奇,刘景发.基于欧氏距离的矩形 Packing 问题的确定性启发式求解算法.计算机学报,2006,29(5):734−739.
[15] 何琨,姬朋立,李初民.求解二维矩形 Packing 面积最小化问题的动态归约算法.软件学报,2013,24(9):2078−2088. http://www.jos.
org.cn/1000-9825/4404.htm [doi: 10.3724/SP.J.1001.2013.04404]
[39] 陈梦烦.二维条形装箱问题的混合启发式算法研究[硕士学位论文].厦门:厦门大学,2020.

阳名钢(1998－),男,硕士生,主要研究领域 杨双远(1976－),男,博士,副教授,主要研
为大数据,人工智能. 究领域为人工智能,图像处理.

陈梦烦(1994－),女,硕士,主要研究领域为 张德富(1971－),男,博士,教授,博士生导
大数据,人工智能. 师,CCF 高级会员,主要研究领域为大数
据,人工智能.