A Q-learning-based algorithm for the 2D-rectangular packing problem

[1]  Jie Zhang,et al.  Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming , 2021, IEEE Transactions on Cybernetics.

[2]  Zhiguang Cao,et al.  Step-Wise Deep Learning Models for Solving Routing Problems , 2020, IEEE Transactions on Industrial Informatics.

[3]  Chi-Wing Fu,et al.  Mononizing binocular videos , 2020, ACM Trans. Graph..

[4]  Tao Hao,et al.  A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem , 2020, Neurocomputing.

[5]  Xiangyang Tang,et al.  An efficient deterministic heuristic algorithm for the rectangular packing problem , 2019, Comput. Ind. Eng..

[6]  Kyungsik Lee,et al.  Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem , 2019, Comput. Oper. Res..

[7]  Jian Huang,et al.  An open space based heuristic for the 2D strip packing problem with unloading constraints , 2019, Applied Mathematical Modelling.

[8]  James J. Q. Yu,et al.  Online Vehicle Routing With Neural Combinatorial Optimization and Deep Reinforcement Learning , 2019, IEEE Transactions on Intelligent Transportation Systems.

[9]  Madalina M. Drugan,et al.  Reinforcement learning versus evolutionary computation: A survey on hybrid algorithms , 2019, Swarm Evol. Comput..

[10]  Eduardo Uchoa,et al.  Improved state space relaxation for constrained two-dimensional guillotine cutting problems , 2019, Eur. J. Oper. Res..

[11]  Yoshua Bengio,et al.  Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon , 2018, Eur. J. Oper. Res..

[12]  Yu Qian,et al.  A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem , 2018, AAMAS.

[13]  Hans Sebastian Heese,et al.  Two-dimensional cutting stock problem with sequence dependent setup times , 2018, Eur. J. Oper. Res..

[14]  Ruslan Sadykov,et al.  Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem , 2018, Discret. Optim..

[15]  Lei Wu,et al.  An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles , 2017, Eng. Appl. Artif. Intell..

[16]  Kevin Tierney,et al.  Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem , 2017, Comput. Oper. Res..

[17]  Andrew Lim,et al.  An adaptive selection approach for the 2D rectangle packing area minimization problem , 2017, Omega.

[18]  Lijun Wei,et al.  An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation , 2017, Comput. Oper. Res..

[19]  Anurag Gupta,et al.  Small Boxes Big Data: A Deep Learning Approach to Optimize Variable Sized Bin Packing , 2017, 2017 IEEE Third International Conference on Big Data Computing Service and Applications (BigDataService).

[20]  Lei Wu,et al.  A novel heuristic algorithm for two-dimensional rectangle packing area minimization problem with central rectangle , 2016, Comput. Ind. Eng..

[21]  Navdeep Jaitly,et al.  Pointer Networks , 2015, NIPS.

[22]  Yanchao Wang,et al.  Two-dimensional residual-space-maximized packing , 2015, Expert Syst. Appl..

[23]  Kun He,et al.  Dynamic reduction heuristics for the rectangle packing area minimization problem , 2015, Eur. J. Oper. Res..

[24]  José Fernando Oliveira,et al.  2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems , 2014, Eur. J. Oper. Res..

[25]  Quoc V. Le,et al.  Sequence to Sequence Learning with Neural Networks , 2014, NIPS.

[26]  Yan Jin,et al.  Heuristics for two-dimensional strip packing problem with 90° rotations , 2013, Expert Syst. Appl..

[27]  Flávio Keidi Miyazawa,et al.  Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints , 2013 .

[28]  C. Potts,et al.  A genetic algorithm for two-dimensional bin packing with due dates , 2013 .

[29]  Patrick De Causmaecker,et al.  An improved best-fit heuristic for the orthogonal strip packing problem , 2013, Int. Trans. Oper. Res..

[30]  Kai Zhang,et al.  Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing , 2013, Expert Syst. Appl..

[31]  Fabio Furini,et al.  Models for the two-dimensional two-stage cutting stock problem with multiple stock size , 2013, Comput. Oper. Res..

[32]  Yan Jin,et al.  An efficient deterministic heuristic for two-dimensional rectangular packing , 2012, Comput. Oper. Res..

[33]  Andrew Lim,et al.  A skyline heuristic for the 2D rectangular packing and strip packing problems , 2011, Eur. J. Oper. Res..

[34]  Kwang Mong Sim,et al.  A two-stage intelligent search algorithm for the two-dimensional strip packing problem , 2011, Eur. J. Oper. Res..

[35]  Stephen C. H. Leung,et al.  A fast layer-based heuristic for non-guillotine strip packing , 2011, Expert Syst. Appl..

[36]  Ender Özcan,et al.  Bidirectional best-fit heuristic for orthogonal rectangular strip packing , 2009, Ann. Oper. Res..

[37]  Graham Kendall,et al.  A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem , 2009, INFORMS J. Comput..

[38]  Julia A. Bennell,et al.  The geometry of nesting problems: A tutorial , 2008, Eur. J. Oper. Res..

[39]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[40]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[41]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[42]  Bengt-Erik Bengtsson,et al.  Packing Rectangular Pieces - A Heuristic Approach , 1982, Comput. J..

[43]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[44]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[45]  Hao Zhang,et al.  TAP-Net: Transport-and-Pack using Reinforcement Learning , 2020 .

[46]  Oriol Vinyals,et al.  Order Matters: Sequence to sequence for sets , 2016, ICLR 2016.

[47]  Shuangyuan Yang,et al.  A simple randomized algorithm for two-dimensional strip packing , 2013, Comput. Oper. Res..

[48]  Andrea Lodi,et al.  Exact algorithms for the two-dimensional guillotine knapsack , 2012, Comput. Oper. Res..

[49]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[50]  Eva Hopper,et al.  Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods , 2002 .

[51]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..