{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:14:47Z","timestamp":1726413287367},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51975231"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundational Research Funds for the Central Universities","award":["2019kfyXKJC043"]},{"name":"Open fund of Hubei Key Laboratory of hydropower engineering construction and management","award":["2020KSD15"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00500-023-08381-9","type":"journal-article","created":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T15:01:20Z","timestamp":1685890880000},"page":"12057-12070","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Q-learning-based algorithm for the 2D-rectangular packing problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Xusheng","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7752-3502","authenticated-orcid":false,"given":"Yunqing","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Ronghua","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,4]]},"reference":[{"issue":"1","key":"8381_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10479-009-0642-0","volume":"172","author":"\u00d6B A\u015f\u0131k","year":"2009","unstructured":"A\u015f\u0131k \u00d6B, \u00d6zcan E (2009) Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Ann Oper Res 172(1):405\u2013427","journal-title":"Ann Oper Res"},{"issue":"4","key":"8381_CR2","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG Jr, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855","journal-title":"SIAM J Comput"},{"issue":"2","key":"8381_CR3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"issue":"3","key":"8381_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"BE Bengtsson","year":"1982","unstructured":"Bengtsson BE (1982) Packing rectangular pieces\u2014a heuristic approach. Comput J 25(3):353\u2013357","journal-title":"Comput J"},{"issue":"2","key":"8381_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell JA, Oliveira JF (2008) The geometry of nesting problems: a tutorial. Eur J Oper Res 184(2):397\u2013415","journal-title":"Eur J Oper Res"},{"issue":"2","key":"8381_CR6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"JA Bennell","year":"2013","unstructured":"Bennell JA, Lee LS, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145(2):547\u2013560","journal-title":"Int J Prod Econ"},{"issue":"4","key":"8381_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671","journal-title":"Oper Res"},{"issue":"3","key":"8381_CR8","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2009","unstructured":"Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J Comput 21(3):505\u2013516","journal-title":"INFORMS J Comput"},{"issue":"8","key":"8381_CR9","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32","author":"B Chazelle","year":"1983","unstructured":"Chazelle B (1983) The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 32(8):697\u2013709","journal-title":"IEEE Trans Comput"},{"key":"8381_CR10","volume":"137","author":"M Chen","year":"2019","unstructured":"Chen M, Wu C, Tang X, Peng X, Zeng Z, Liu S (2019) An efficient deterministic heuristic algorithm for the rectangular packing problem. Comput Ind Eng 137:106097","journal-title":"Comput Ind Eng"},{"issue":"1","key":"8381_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30\u201344","journal-title":"Oper Res"},{"key":"8381_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.disopt.2018.02.003","volume":"29","author":"F Clautiaux","year":"2018","unstructured":"Clautiaux F, Sadykov R, Vanderbeck F, Viaud Q (2018) Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discret Optim 29:18\u201344","journal-title":"Discret Optim"},{"issue":"1","key":"8381_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M Dolatabadi","year":"2012","unstructured":"Dolatabadi M, Lodi A, Monaci M (2012) Exact algorithms for the two-dimensional guillotine knapsack. Comput Oper Res 39(1):48\u201353","journal-title":"Comput Oper Res"},{"key":"8381_CR14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.swevo.2018.03.011","volume":"44","author":"MM Drugan","year":"2019","unstructured":"Drugan MM (2019) Reinforcement learning versus evolutionary computation: a survey on hybrid algorithms. Swarm Evol Comput 44:228\u2013246","journal-title":"Swarm Evol Comput"},{"key":"8381_CR15","unstructured":"Duan, L., Hu, H., Qian, Y., Gong, Y., Zhang, X., Wei, J., & Xu, Y. (2019, May). A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems\u00a0(pp 1386\u20131394)."},{"issue":"8","key":"8381_CR16","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2013.02.026","volume":"40","author":"F Furini","year":"2013","unstructured":"Furini F, Malaguti E (2013) Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput Oper Res 40(8):1953\u20131962","journal-title":"Comput Oper Res"},{"key":"8381_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neucom.2019.06.111","volume":"390","author":"S Gu","year":"2020","unstructured":"Gu S, Hao T, Yao H (2020) A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem. Neurocomputing 390:1\u201311","journal-title":"Neurocomputing"},{"issue":"7","key":"8381_CR18","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1016\/j.cor.2011.08.005","volume":"39","author":"K He","year":"2012","unstructured":"He K, Huang W, Jin Y (2012) An efficient deterministic heuristic for two-dimensional rectangular packing. Comput Oper Res 39(7):1355\u20131363","journal-title":"Comput Oper Res"},{"issue":"14","key":"8381_CR19","doi-asserted-by":"crossref","first-page":"5542","DOI":"10.1016\/j.eswa.2013.04.005","volume":"40","author":"K He","year":"2013","unstructured":"He K, Jin Y, Huang W (2013) Heuristics for two-dimensional strip packing problem with 90 rotations. Expert Syst Appl 40(14):5542\u20135550","journal-title":"Expert Syst Appl"},{"issue":"3","key":"8381_CR20","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2014.09.042","volume":"241","author":"K He","year":"2015","unstructured":"He K, Ji P, Li C (2015) Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur J Oper Res 241(3):674\u2013685","journal-title":"Eur J Oper Res"},{"issue":"1","key":"8381_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"EBCH Hopper","year":"2001","unstructured":"Hopper EBCH, Turton BC (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128(1):34\u201357","journal-title":"Eur J Oper Res"},{"key":"8381_CR22","unstructured":"Hopper, E. (2000). Two-Dimensional packing utilising evolutionary algorithms and other meta-heuristic methods [Ph. D. Thesis].\u00a0Cardiff: Cardiff University."},{"key":"8381_CR23","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104781","volume":"113","author":"A Hottung","year":"2020","unstructured":"Hottung A, Tanaka S, Tierney K (2020) Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput Oper Res 113:104781","journal-title":"Comput Oper Res"},{"issue":"6","key":"8381_CR24","first-page":"1","volume":"39","author":"R Hu","year":"2020","unstructured":"Hu R, Xu J, Chen B, Gong M, Zhang H, Huang H (2020) TAP-Net: transport-and-pack using reinforcement learning. ACM Transactions on Graphics (TOG) 39(6):1\u201315","journal-title":"ACM Transactions on Graphics (TOG)"},{"issue":"10","key":"8381_CR25","doi-asserted-by":"crossref","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","volume":"20","author":"JQ James","year":"2019","unstructured":"James JQ, Yu W, Gu J (2019) Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Trans Intell Transp Syst 20(10):3806\u20133817","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"8381_CR26","unstructured":"Jiang, Y., Cao, Z., & Zhang, J. (2021). Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming.\u00a0IEEE transactions on cybernetics."},{"key":"8381_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cor.2019.05.005","volume":"109","author":"SJ Kwon","year":"2019","unstructured":"Kwon SJ, Joung S, Lee K (2019) Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem. Comput Oper Res 109:159\u2013169","journal-title":"Comput Oper Res"},{"issue":"10","key":"8381_CR28","doi-asserted-by":"crossref","first-page":"13032","DOI":"10.1016\/j.eswa.2011.04.105","volume":"38","author":"SC Leung","year":"2011","unstructured":"Leung SC, Zhang D (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst Appl 38(10):13032\u201313042","journal-title":"Expert Syst Appl"},{"issue":"1","key":"8381_CR29","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"SC Leung","year":"2011","unstructured":"Leung SC, Zhang D, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur J Oper Res 215(1):57\u201369","journal-title":"Eur J Oper Res"},{"issue":"1","key":"8381_CR30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.cor.2010.10.022","volume":"39","author":"SC Leung","year":"2012","unstructured":"Leung SC, Zhang D, Zhou C, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(1):64\u201373","journal-title":"Comput Oper Res"},{"key":"8381_CR31","doi-asserted-by":"crossref","unstructured":"Mao F, Blanco E, Fu M, Jain R, Gupta A, Mancel S, Tian Y (2017, April). Small boxes big data: A deep learning approach to optimize variable sized bin packing. In\u00a02017 IEEE Third International Conference on Big Data Computing Service and Applications (BigDataService)\u00a0(pp. 80\u201389). IEEE","DOI":"10.1109\/BigDataService.2017.18"},{"issue":"10","key":"8381_CR32","doi-asserted-by":"crossref","first-page":"4035","DOI":"10.1016\/j.eswa.2013.01.005","volume":"40","author":"E \u00d6zcan","year":"2013","unstructured":"\u00d6zcan E, Kai Z, Drake JH (2013) Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing. Expert Syst Appl 40(10):4035\u20134043","journal-title":"Expert Syst Appl"},{"issue":"2","key":"8381_CR33","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.ijpe.2013.04.032","volume":"145","author":"TA Queiroz","year":"2013","unstructured":"Queiroz TA, Miyazawa FK (2013) Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. Int J Prod Econ 145(2):511\u2013530","journal-title":"Int J Prod Econ"},{"issue":"3","key":"8381_CR34","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1016\/j.ejor.2014.02.059","volume":"237","author":"E Silva","year":"2014","unstructured":"Silva E, Oliveira JF, W\u00e4scher G (2014) 2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems. Eur J Oper Res 237(3):846\u2013856","journal-title":"Eur J Oper Res"},{"key":"8381_CR35","unstructured":"Sutskever, I., Vinyals, O., & Le, Q. V. (2014). Sequence to sequence learning with neural networks.\u00a0Advances in neural information processing systems,\u00a027."},{"issue":"1","key":"8381_CR36","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2018.06.016","volume":"272","author":"AS Velasco","year":"2019","unstructured":"Velasco AS, Uchoa E (2019) Improved state space relaxation for constrained two-dimensional guillotine cutting problems. Eur J Oper Res 272(1):106\u2013120","journal-title":"Eur J Oper Res"},{"issue":"5","key":"8381_CR37","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1111\/itor.12030","volume":"20","author":"J Verstichel","year":"2013","unstructured":"Verstichel J, De Causmaecker P, Berghe GV (2013) An improved bestg with neural networks l rectangular cutting and palem. Int Trans Opera Res 20(5):711\u2013730","journal-title":"Int Trans Opera Res"},{"key":"8381_CR38","unstructured":"Vinyals O, Bengio S, Kudlur M (2015a) Order matters: Sequence to sequence for sets.\u00a0arXiv preprint arXiv:1511.06391"},{"key":"8381_CR39","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015b) Pointer networks.\u00a0Advances in neural information processing systems,\u00a028"},{"issue":"7","key":"8381_CR40","doi-asserted-by":"crossref","first-page":"3297","DOI":"10.1016\/j.eswa.2014.12.021","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang Y, Chen L (2015) Two-dimensional residual-space-maximized packing. Expert Syst Appl 42(7):3297\u20133305","journal-title":"Expert Syst Appl"},{"issue":"3","key":"8381_CR41","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"2","key":"8381_CR42","first-page":"337","volume":"215","author":"L Wei","year":"2011","unstructured":"Wei L, Oon WC, Zhu W, Lim A (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur J Oper Res 215(2):337\u2013346","journal-title":"Eur J Oper Res"},{"key":"8381_CR43","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","volume":"80","author":"L Wei","year":"2017","unstructured":"Wei L, Hu Q, Leung SC, Zhang N (2017) An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput Oper Res 80:113\u2013127","journal-title":"Comput Oper Res"},{"key":"8381_CR44","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.omega.2017.09.002","volume":"80","author":"L Wei","year":"2018","unstructured":"Wei L, Zhu W, Lim A, Liu Q, Chen X (2018) An adaptive selection approach for the 2D rectangle packing area minimization problem. Omega 80:22\u201330","journal-title":"Omega"},{"key":"8381_CR45","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.apm.2019.01.022","volume":"70","author":"L Wei","year":"2019","unstructured":"Wei L, Wang Y, Cheng H, Huang J (2019) An open space based heuristic for the 2D strip packing problem with unloading constraints. Appl Math Model 70:67\u201381","journal-title":"Appl Math Model"},{"key":"8381_CR46","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.cie.2016.10.011","volume":"102","author":"L Wu","year":"2016","unstructured":"Wu L, Zhang L, Xiao WS, Liu Q, Mu C, Yang Y (2016) A novel heuristic algorithm for two-dimensional rectangle packing area minimization problem with central rectangle. Comput Ind Eng 102:208\u2013218","journal-title":"Comput Ind Eng"},{"key":"8381_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2017.08.012","volume":"66","author":"L Wu","year":"2017","unstructured":"Wu L, Tian X, Zhang J, Liu Q, Xiao W, Yang Y (2017) An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles. Eng Appl Artif Intell 66:1\u201316","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"8381_CR48","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ejor.2017.07.036","volume":"265","author":"DA Wuttke","year":"2018","unstructured":"Wuttke DA, Heese HS (2018) Two-dimensional cutting stock problem with sequence dependent setup times. Eur J Oper Res 265(1):303\u2013315","journal-title":"Eur J Oper Res"},{"issue":"7","key":"8381_CR49","doi-asserted-by":"crossref","first-page":"4861","DOI":"10.1109\/TII.2020.3031409","volume":"17","author":"L Xin","year":"2020","unstructured":"Xin L, Song W, Cao Z, Zhang J (2020) Step-wise deep learning models for solving routing problems. IEEE Trans Industr Inf 17(7):4861\u20134871","journal-title":"IEEE Trans Industr Inf"},{"issue":"1","key":"8381_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2012.05.001","volume":"40","author":"S Yang","year":"2013","unstructured":"Yang S, Han S, Ye W (2013) A simple randomized algorithm for two-dimensional strip packing. Comput Oper Res 40(1):1\u20138","journal-title":"Comput Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08381-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08381-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08381-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T13:08:06Z","timestamp":1689944886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08381-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":50,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["8381"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08381-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2023,6,4]]},"assertion":[{"value":"28 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest exits in the submission of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}