{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T09:14:03Z","timestamp":1777194843575,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2019PEE013"],"award-info":[{"award-number":["ZR2019PEE013"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3045905","type":"journal-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T21:08:15Z","timestamp":1608325695000},"page":"226784-226796","source":"Crossref","is-referenced-by-count":13,"title":["Hybrid Heuristic Algorithm Based On Improved Rules & Reinforcement Learning for 2D Strip Packing Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6401-2882","authenticated-orcid":false,"given":"Kai","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Naihua","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Xiang Dong","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12138"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106268"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.3.388"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.1.30"},{"key":"ref31","article-title":"Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods","author":"hopper","year":"2000"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00357-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2006.360"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/25.3.353"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4137-7_24"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.105"},{"key":"ref10","first-page":"241","article-title":"Solving two-dimensional packing problem using particle swarm optimization","volume":"19","author":"shin","year":"2017","journal-title":"Computer Assisted Methods in Engineering and Science"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.11.024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2702715"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0209064"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2582731"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.07.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/InfoSEEE.2014.6947877"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.06.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.05.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3000236"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.06.022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.08.024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/RO-MAN46459.2019.8956393"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.310.16082"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00166-9"},{"key":"ref29","article-title":"Heuristic algorithms for 2D strip packing problem","author":"gao","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1578914"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1990.142096"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.062"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.1.49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0306"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2933002"},{"key":"ref22","article-title":"Solving np-hard problems on graphs by reinforcement learning without domain knowledge","author":"abe","year":"2019","journal-title":"arXiv 1905 11623"},{"key":"ref21","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","author":"ma","year":"2019","journal-title":"arXiv 1911 04936"},{"key":"ref42","author":"van vuuren","year":"2018","journal-title":"The 2D Rectangular Strip Packing Problem (Clustered Benchmarks)"},{"key":"ref24","article-title":"Reinforcement learning for combinatorial optimization: A survey","author":"mazyavkina","year":"2020","journal-title":"arXiv 2003 03600"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2882823"},{"key":"ref23","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"2016","journal-title":"arXiv 1611 09940"},{"key":"ref26","article-title":"Fast detection of maximum common subgraph via deep Q-learning","author":"bai","year":"2020","journal-title":"arXiv 2002 03129"},{"key":"ref25","article-title":"Exploratory combinatorial optimization with reinforcement learning","author":"barrett","year":"2019","journal-title":"arXiv 1909 04063"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09298860.pdf?arnumber=9298860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:39Z","timestamp":1639770939000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9298860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3045905","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}