{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T23:46:53Z","timestamp":1793144813560,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The higher committee for Education Development in Iraq"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654074","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T12:33:04Z","timestamp":1720441984000},"page":"1463-1469","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A Differential Pheromone Grouping Ant Colony Optimization Algorithm for the 1-D Bin Packing Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2517-9700","authenticated-orcid":false,"given":"Aseel Ismael","family":"Ali","sequence":"first","affiliation":[{"name":"University of Exeter, Exeter, United Kingdom"},{"name":"Gifted Guardianship Committee, Minster of Education,, Baghdad, Iraq"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3650-6487","authenticated-orcid":false,"given":"Edward","family":"Keedwell","sequence":"additional","affiliation":[{"name":"University of Exeter, Exeter, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7003-9945","authenticated-orcid":false,"given":"Ayah","family":"Helal","sequence":"additional","affiliation":[{"name":"University of Exeter, Exeter, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00818-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-020-00695-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/I-SMAC52330.2021.9640743"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-017-1192-z"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"e_1_3_2_1_7_1","unstructured":"Frederick Ducatelle and John Levine. 2002. Ant Colony Optimisation for Bin Packing and Cutting Stock Problems. http:\/\/www.informatics.ed.ac.uk\/ use item-oriented approach."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.CIE.2021.107844"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00773-021-00842-w"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"D S Johnsonf A Demers:T: J D Ullman M R Gareyi and R L Grahamii. 1974. WORST-CASE PERFORMANCE BOUNDS FOR SIMPLE ONE-DIMENSIONAL PACKING ALGORITHMS*. Issue 4.","DOI":"10.1137\/0203025"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00247-3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586259"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601771"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.21833\/AEEE.2019.11.002"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9989-x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1515\/jisys-2020-0117"},{"key":"e_1_3_2_1_20_1","unstructured":"Pooya Nikbakht. 2022. Applications and Extensions of The Bin Packing Problem. (2022)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.10.010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"A. Silva-G\u00e1lvez E. Lara-C\u00e1rdenas I. Amaya J. M. Cruz-Duarte and J. C. Ortiz-Bayliss. 2020. A Preliminary Study on Score-Based Hyper-heuristics for Solving the Bin Packing Problem. Vol. 12088 LNCS. Springer 318--327. 10.1007\/978-3-030-49076-8_30","DOI":"10.1007\/978-3-030-49076-8_30"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100993"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMSE.2014.6930200"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654074","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:56:50Z","timestamp":1750276610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":24,"alternative-id":["10.1145\/3638529.3654074","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654074","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}