{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:21:09Z","timestamp":1759882869913,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","funder":[{"name":"Bavarian State Ministry for Economic Affairs, Regional Development and Energy","award":["DIK0448\/01"],"award-info":[{"award-number":["DIK0448\/01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3726651","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:15:44Z","timestamp":1754925344000},"page":"515-518","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Genetic Algorithm for Solving the Three-Dimensional Bin Set Selection Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9796-125X","authenticated-orcid":false,"given":"Leon","family":"Binder","sequence":"first","affiliation":[{"name":"Deggendorf Institute of Technology, Deggendorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0173-2900","authenticated-orcid":false,"given":"Michael","family":"Scholz","sequence":"additional","affiliation":[{"name":"Deggendorf Institute of Technology, Deggendorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12128"},{"key":"e_1_3_2_1_2_1","volume-title":"https:\/\/www.dhl.com\/us-en\/home\/ecommerce\/business-help-center\/chargeable-weight.html Retrieved on","author":"Chargeable Weight DHL.","year":"2025","unstructured":"DHL. 2025. Chargeable Weight. https:\/\/www.dhl.com\/us-en\/home\/ecommerce\/business-help-center\/chargeable-weight.html Retrieved on January 16, 2025."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2369"},{"key":"e_1_3_2_1_4_1","unstructured":"Guang Yang. 2017. gbp: A Bin Packing Problem Solver. https:\/\/cran.r-project.org\/web\/packages\/gbp\/index.html Version 0.1.0.4."},{"key":"e_1_3_2_1_5_1","volume-title":"Variable neighborhood genetic algorithm for multi-order multi-bin open packing optimization. Applied Soft Computing 163, 111890","author":"Yang Jianglong","year":"2024","unstructured":"Jianglong Yang, Huwei Liu, Kaibo Liang, Li Zhou, and Junhui Zhao. 2024. Variable neighborhood genetic algorithm for multi-order multi-bin open packing optimization. Applied Soft Computing 163, 111890 (2024), 1\u201320."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2023.2269868"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3726651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:57:22Z","timestamp":1759838242000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3726651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":6,"alternative-id":["10.1145\/3712255.3726651","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3726651","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}