{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T23:08:08Z","timestamp":1769555288529,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031900648","type":"print"},{"value":"9783031900655","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-90065-5_24","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:38Z","timestamp":1745377718000},"page":"386-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Beyond the\u00a0Hype: Benchmarking LLM-Evolved Heuristics for\u00a0Bin Packing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6555-7721","authenticated-orcid":false,"given":"Kevin","family":"Sim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2487-981X","authenticated-orcid":false,"given":"Quentin","family":"Renau","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5405-4413","authenticated-orcid":false,"given":"Emma","family":"Hart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"24_CR1","unstructured":"BPPLIB - A bin packing problem library. https:\/\/site.unibo.it\/operations-research\/en\/research\/bpplib-a-bin-packing-problem-library"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Alissa, M., Sim, K., Hart, E.: Algorithm selection using deep learning without feature extraction. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 198\u2013206 (2019)","DOI":"10.1145\/3321707.3321845"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1613\/jair.1.14820","volume":"78","author":"S Angelopoulos","year":"2023","unstructured":"Angelopoulos, S., Kamali, S., Shadkami, K.: Online bin packing with predictions. J. Artif. Intell. Res. 78, 1111\u20131141 (2023)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR4","unstructured":"Angelopoulos, S., Kamali, S., Shadkami, K.: Binpackingpredictions (2024). https:\/\/github.com\/shahink84\/BinPackingPredictions\/tree\/main\/Data\/Benchmarks"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Anonymous: Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing - Data (2024). https:\/\/doi.org\/10.5281\/zenodo.14162744. https:\/\/doi.org\/10.5281\/zenodo.14162744","DOI":"10.5281\/zenodo.14162744"},{"issue":"11","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","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.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automating the packing heuristic design process with genetic programming. Evol. Comput. 20(1), 63\u201389 (2012)","journal-title":"Evol. Comput."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-33558-7_17","volume-title":"Principles and Practice of Constraint Programming","author":"I Casti\u00f1eiras","year":"2012","unstructured":"Casti\u00f1eiras, I., De Cauwer, M., O\u2019Sullivan, B.: Weibull-based benchmarks for bin packing. In: Milano, M. (ed.) CP 2012. LNCS, pp. 207\u2013222. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_17"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A., et\u00a0al.: A genetic algorithm for bin packing and line balancing. In: ICRA, pp. 1186\u20131192. Citeseer (1992)","DOI":"10.1109\/ROBOT.1992.220088"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.2015.0670","volume":"28","author":"T Gschwind","year":"2016","unstructured":"Gschwind, T., Irnich, S.: Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28(1), 175\u2013194 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tusar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optim. Methods Softw. 36(1), 114\u2013144 (2021). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001). https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"key":"24_CR16","unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)"},{"key":"24_CR17","unstructured":"Liu, F., et al.: Evolution of heuristics: towards efficient automatic algorithm design using large language model. In: Forty-first International Conference on Machine Learning (2024)"},{"key":"24_CR18","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., Birattari, M., St\u00fctzl, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.ejor.2024.06.001","volume":"318","author":"R Mart\u00edn-Santamar\u00eda","year":"2024","unstructured":"Mart\u00edn-Santamar\u00eda, R., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T., Colmenar, J.M.: On the automatic generation of metaheuristic algorithms for combinatorial optimization problems. Eur. J. Oper. Res. 318, 740\u2013751 (2024)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-16711-0_7","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"P McMenemy","year":"2019","unstructured":"McMenemy, P., Veerapen, N., Adair, J., Ochoa, G.: Rigorous performance analysis of state-of-the-art TSP heuristic solvers. In: Liefooghe, A., Paquete, L. (eds.) EvoCOP 2019. LNCS, vol. 11452, pp. 99\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16711-0_7"},{"key":"24_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Pluhacek, M., Kovac, J., Viktorin, A., Janku, P., Kadavy, T., Senkerik, R.: Using LLM for automatic evolvement of metaheuristics from swarm algorithm soma. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 2018\u20132022 (2024)","DOI":"10.1145\/3638530.3664181"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 477\u2013484 (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"24_CR24","doi-asserted-by":"publisher","DOI":"10.1201\/9781420087444","volume-title":"The Weibull Distribution: A Handbook","author":"H Rinne","year":"2008","unstructured":"Rinne, H.: The Weibull Distribution: A Handbook. Chapman and Hall\/CRC, Boca Raton (2008)"},{"issue":"7995","key":"24_CR25","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1038\/s41586-023-06924-6","volume":"625","author":"B Romera-Paredes","year":"2024","unstructured":"Romera-Paredes, B., et al.: Mathematical discoveries from program search with large language models. Nature 625(7995), 468\u2013475 (2024)","journal-title":"Nature"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, M., Cruz-Duarte, J.M., carlos Ort\u00edz-Bayliss, J., Ceballos, H., Terashima-Marin, H., Amaya, I.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8, 128068\u2013128095 (2020)","DOI":"10.1109\/ACCESS.2020.3009318"},{"issue":"7","key":"24_CR27","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., J\u00fcrgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"24_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3572895","volume":"55","author":"K Smith-Miles","year":"2023","unstructured":"Smith-Miles, K., Mu\u00f1oz, M.A.: Instance space analysis for algorithm testing: methodology and software tools. ACM Comput. Surv. 55(12), 1\u201331 (2023)","journal-title":"ACM Comput. Surv."},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"van Stein, N., B\u00e4ck, T.: LLaMEA: a large language model evolutionary algorithm for automatically generating metaheuristics. arXiv preprint arXiv:2405.20132 (2024)","DOI":"10.1109\/TEVC.2024.3497793"},{"key":"24_CR30","unstructured":"van Stein, N., Vermetten, D., B\u00e4ck, T.: In-the-loop hyper-parameter optimization for llm-based automated design of heuristics. arXiv preprint arXiv:2410.16309 (2024)"},{"issue":"4","key":"24_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"key":"24_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109696","volume":"130","author":"M \u0110urasevi\u0107","year":"2022","unstructured":"\u0110urasevi\u0107, M., \u0110umi\u0107, M.: Automated design of heuristics for the container relocation problem using genetic programming. Appl. Soft Comput. 130, 109696 (2022)","journal-title":"Appl. Soft Comput."},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"W\u00e4scher, G., Gau, T.: Heuristics for the integer one-dimensional cutting stock problem: a computational study. Oper.-Res.-Spektrum 18, 131\u2013144 (1996)","DOI":"10.1007\/BF01539705"},{"key":"24_CR34","unstructured":"Ye, H., et al.: ReEvo: large language models as hyper-heuristics with reflective evolution. arXiv preprint arXiv:2402.01145 (2024)"},{"key":"24_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-031-70068-2_12","volume-title":"PPSN 2024","author":"R Zhang","year":"2024","unstructured":"Zhang, R., Liu, F., Lin, X., Wang, Z., Lu, Z., Zhang, Q.: Understanding the importance of evolutionary search in automated heuristic design with large language models. In: Affenzeller, M., et al. (eds.) PPSN 2024. LNCS, vol. 15149, pp. 185\u2013202. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70068-2_12"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90065-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:46Z","timestamp":1745377726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90065-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031900648","9783031900655"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90065-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}