{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:07:34Z","timestamp":1764688054283,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BNRist","award":["BNRist"],"award-info":[{"award-number":["BNRist"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022ZD0116402"],"award-info":[{"award-number":["2022ZD0116402"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2057, U21B2036, 62171260"],"award-info":[{"award-number":["U22B2057, U21B2036, 62171260"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599860","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"3713-3723","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning to Solve Grouped 2D Bin Packing Problems in the Manufacturing Industry"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5310-0652","authenticated-orcid":false,"given":"Wenxuan","family":"Ao","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0592-2285","authenticated-orcid":false,"given":"Guozhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University & TsingRoc, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5617-1659","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0419-5514","authenticated-orcid":false,"given":"Depeng","family":"Jin","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"International Conference on Variable Neighborhood Search.","author":"Adouani Yassine","year":"2018","unstructured":"Yassine Adouani , Bassem Jarboui , and Malek Masmoudi . 2018 . A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup . In International Conference on Variable Neighborhood Search. Yassine Adouani, Bassem Jarboui, and Malek Masmoudi. 2018. A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup. In International Conference on Variable Neighborhood Search."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-016-1234-x"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209064"},{"key":"e_1_3_2_2_4_1","volume-title":"Parameters for a Genetic Algorithm: An Application for the Order Batching Problem. IBIMA Business Review","author":"Cano Jose Alejandro","year":"2019","unstructured":"Jose Alejandro Cano . 2019. Parameters for a Genetic Algorithm: An Application for the Order Batching Problem. IBIMA Business Review ( 2019 ). Jose Alejandro Cano. 2019. Parameters for a Genetic Algorithm: An Application for the Order Batching Problem. IBIMA Business Review (2019)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2014.11.008"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.2.123"},{"key":"e_1_3_2_2_7_1","volume-title":"A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems. Mathematics","author":"Fang Jie","year":"2023","unstructured":"Jie Fang , Yunqing Rao , Xusheng Zhao , and Bing Du. 2023. A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems. Mathematics ( 2023 ). Jie Fang, Yunqing Rao, Xusheng Zhao, and Bing Du. 2023. A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems. Mathematics (2023)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.05.024"},{"key":"e_1_3_2_2_9_1","volume-title":"Johnson","author":"Garey M. R.","year":"1978","unstructured":"M. R. Garey and David S . Johnson . 1978 . Computers and Intractability: A Guide to the Theory of NP-Completeness . M. R. Garey and David S. Johnson. 1978. Computers and Intractability: A Guide to the Theory of NP-Completeness."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790296"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790296"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.062"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0278-6"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNSC55942.2022.10004170"},{"volume-title":"Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming","author":"Jiang Yuan","key":"e_1_3_2_2_15_1","unstructured":"Yuan Jiang , Zhiguang Cao , and Jie Zhang . 2021. Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming . IEEE transactions on cybernetics, Vol. PP (2021). Yuan Jiang, Zhiguang Cao, and Jie Zhang. 2021. Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming. IEEE transactions on cybernetics, Vol. PP (2021)."},{"key":"e_1_3_2_2_16_1","volume-title":"A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http:\/\/clb. demon. fi\/files\/RectangleBinPack. pdf","author":"Jukka","year":"2010","unstructured":"Jukka Jyl\u00e4;nki. 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http:\/\/clb. demon. fi\/files\/RectangleBinPack. pdf ( 2010 ). Jukka Jyl\u00e4;nki. 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http:\/\/clb. demon. fi\/files\/RectangleBinPack. pdf (2010)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJENM.2019.098107"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02283751"},{"key":"e_1_3_2_2_19_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba . 2014 . Adam : A Method for Stochastic Optimization. CoRR , Vol. abs\/ 1412 .6980 (2014). Diederik P. Kingma and Jimmy Ba. 2014. Adam: A Method for Stochastic Optimization. CoRR, Vol. abs\/1412.6980 (2014)."},{"key":"e_1_3_2_2_20_1","volume-title":"International Conference on Learning Representations.","author":"Kool Wouter","year":"2018","unstructured":"Wouter Kool , Herke van Hoof , and Max Welling . 2018 . Attention, Learn to Solve Routing Problems! . In International Conference on Learning Representations. Wouter Kool, Herke van Hoof, and Max Welling. 2018. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/RO-MAN46459.2019.8956393"},{"key":"e_1_3_2_2_22_1","volume-title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. ArXiv","author":"Kwon Yeong-Dae","year":"2020","unstructured":"Yeong-Dae Kwon , Jinho Choo , Byoungjip Kim , Iljoo Yoon , Seungjai Min , and Youngjune Gwon . 2020 . POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. ArXiv , Vol. abs\/ 2010 .16011 (2020). Yeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon, Seungjai Min, and Youngjune Gwon. 2020. POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. ArXiv, Vol. abs\/2010.16011 (2020)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00218-7"},{"key":"e_1_3_2_2_24_1","volume-title":"Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows. ArXiv","author":"Liu Shengcai","year":"2020","unstructured":"Shengcai Liu , Ke Tang , and Xin Yao . 2020. Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows. ArXiv , Vol. abs\/ 2011 .06331 ( 2020 ). Shengcai Liu, Ke Tang, and Xin Yao. 2020. Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows. ArXiv, Vol. abs\/2011.06331 (2020)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038915.62826.79"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3020-x"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.3.388"},{"key":"e_1_3_2_2_28_1","volume-title":"International Transactions in Operational Research","author":"Oliveira \u00d3scar","year":"2022","unstructured":"\u00d3scar Oliveira , Dorabela Gamboa , and Elsa Silva . 2022. An introduction to the two-dimensional rectangular cutting and packing problem . International Transactions in Operational Research ( 2022 ). \u00d3scar Oliveira, Dorabela Gamboa, and Elsa Silva. 2022. An introduction to the two-dimensional rectangular cutting and packing problem. International Transactions in Operational Research (2022)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.2991\/icmeit-19.2019.34"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9982095"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.064"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.08.002"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100643"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.04.021"},{"key":"e_1_3_2_2_35_1","volume-title":"Proximal Policy Optimization Algorithms. ArXiv","author":"Schulman John","year":"2017","unstructured":"John Schulman , Filip Wolski , Prafulla Dhariwal , Alec Radford , and Oleg Klimov . 2017. Proximal Policy Optimization Algorithms. ArXiv , Vol. abs\/ 1707 .06347 ( 2017 ). John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. ArXiv, Vol. abs\/1707.06347 (2017)."},{"key":"e_1_3_2_2_36_1","volume-title":"Attention is All you Need. ArXiv","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani , Noam M. Shazeer , Niki Parmar , Jakob Uszkoreit , Llion Jones , Aidan N. Gomez , Lukasz Kaiser , and Illia Polosukhin . 2017. Attention is All you Need. ArXiv , Vol. abs\/ 1706 .03762 ( 2017 ). Ashish Vaswani, Noam M. Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. ArXiv, Vol. abs\/1706.03762 (2017)."},{"key":"e_1_3_2_2_37_1","unstructured":"Oriol Vinyals Meire Fortunato and Navdeep Jaitly. 2015. Pointer Networks. In NIPS.  Oriol Vinyals Meire Fortunato and Navdeep Jaitly. 2015. Pointer Networks. In NIPS."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21827-9_29"},{"key":"e_1_3_2_2_39_1","volume-title":"abs\/1703.06114","author":"Zaheer Manzil","year":"2017","unstructured":"Manzil Zaheer , Satwik Kottur , Siamak Ravanbakhsh , Barnab\u00e1s P\u00f3czos , Ruslan Salakhutdinov , and Alex Smola . 2017. Deep Sets . ArXiv, Vol. abs\/1703.06114 ( 2017 ). Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnab\u00e1s P\u00f3czos, Ruslan Salakhutdinov, and Alex Smola. 2017. Deep Sets. ArXiv, Vol. abs\/1703.06114 (2017)."},{"key":"e_1_3_2_2_40_1","volume-title":"Online 3D Bin Packing with Constrained Deep Reinforcement Learning. ArXiv","author":"Zhao Hang","year":"2020","unstructured":"Hang Zhao , Qijin She , Chenyang Zhu , Y. Yang , and Kai Xu. 2020. Online 3D Bin Packing with Constrained Deep Reinforcement Learning. ArXiv , Vol. abs\/ 2006 .14978 ( 2020 ). Hang Zhao, Qijin She, Chenyang Zhu, Y. Yang, and Kai Xu. 2020. Online 3D Bin Packing with Constrained Deep Reinforcement Learning. ArXiv, Vol. abs\/2006.14978 (2020)."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Long Beach CA USA","acronym":"KDD '23"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:23Z","timestamp":1750182563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":40,"alternative-id":["10.1145\/3580305.3599860","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599860","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}