{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T07:00:45Z","timestamp":1771743645838,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819570805","type":"print"},{"value":"9789819570812","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7081-2_48","type":"book-chapter","created":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T06:45:01Z","timestamp":1771742701000},"page":"686-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hyper-heuristic Approach to\u00a0Bi-space Search for\u00a0Bin Packing Problems"],"prefix":"10.1007","author":[{"given":"Derrick","family":"Beckdahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3902-5582","authenticated-orcid":false,"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4676-6063","authenticated-orcid":false,"given":"Thambo","family":"Nyathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-61534-5_25","volume-title":"Artificial Intelligence and Soft Computing","author":"D Beckedahl","year":"2020","unstructured":"Beckedahl, D., Pillay, N.: A study of bi-space search for solving the one-dimensional bin packing problem. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing, pp. 277\u2013289. Springer International Publishing, Cham (2020)"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-031-23480-4_17","volume-title":"Artificial Intelligence and Soft Computing","author":"D Beckedahl","year":"2023","unstructured":"Beckedahl, D., Pillay, N.: Bi-space search: optimizing the hybridization of search spaces in solving the one dimensional bin packing problem. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing, pp. 206\u2013217. Springer International Publishing, Cham (2023)"},{"issue":"5","key":"48_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Operational Res. Soc. 38(5), 423\u2013429 (1987)","journal-title":"J. Operational Res. Soc."},{"issue":"2","key":"48_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11590-017-1192-z","volume":"12","author":"M Delorme","year":"2018","unstructured":"Delorme, M., Iori, M., Martello, S.: Bpplib: a library for bin packing and cutting stock problems. Optimiz. Lett. 12(2), 235\u2013250 (2018)","journal-title":"Optimiz. Lett."},{"issue":"1","key":"48_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 5\u201330 (1996)","journal-title":"J. Heuristics"},{"issue":"7","key":"48_CR6","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29(7), 821\u2013839 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"48_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145(2), 500\u2013510 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"48_CR8","volume-title":"A HYFLEX Module for the One Dimensional Bin-packing Problem","author":"M Hyde","year":"2009","unstructured":"Hyde, M., Ochoa, G., Curtois, T., V\u00e1zquez-Rodr\u00edguez, J.: A HYFLEX Module for the One Dimensional Bin-packing Problem. University of Nottingham, School of Computer Science, Tech. rep. (2009)"},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s11590-021-01808-y","volume":"16","author":"M Iori","year":"2021","unstructured":"Iori, M., de Lima, V.L., Martello, S., Monaci, M.: 2dpacklib: a two-dimensional cutting and packing library. Optim. Lett. 16(2), 471\u2013480 (2021)","journal-title":"Optim. Lett."},{"issue":"3","key":"48_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manage. Sci. 44(3), 388\u2013399 (1998)","journal-title":"Manage. Sci."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Misir, M., Verbeeck, K., De\u00a0Causmaecker, P., Berghe, G.V.: Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In: IEEE Congress on Evolutionary Computation, pp.\u00a01\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586348"},{"issue":"1","key":"48_CR12","first-page":"31","volume":"48","author":"N Pillay","year":"2012","unstructured":"Pillay, N.: A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem. South African Comput. J. 48(1), 31\u201340 (2012)","journal-title":"South African Comput. J."},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Pillay, N., Qu, R.: Selection Perturbative Hyper-Heuristics, pp. 17\u201323. Springer International Publishing, Cham (2018). 10.1007\/978-3-319-96514-7_3","DOI":"10.1007\/978-3-319-96514-7_3"},{"issue":"9","key":"48_CR14","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1057\/jors.2008.102","volume":"60","author":"R Qu","year":"2009","unstructured":"Qu, R., Burke, E.K.: Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems. J. Oper. Res. Soc. 60(9), 1273\u20131285 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Quiroz-Castellanos, M., et al.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015)","DOI":"10.1016\/j.cor.2014.10.010"},{"key":"48_CR16","volume-title":"Fast, Exact Solution of Open Bin Packing Problems Without Linear Programming","author":"J Schoenfield","year":"2002","unstructured":"Schoenfield, J.: Fast, Exact Solution of Open Bin Packing Problems Without Linear Programming. Tech. rep, US Army Space and Missile Defense Command, Huntsville, Alabama, USA (2002)"},{"issue":"7","key":"48_CR17","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":"5\u20136","key":"48_CR18","first-page":"377","volume":"4","author":"P Schwerin","year":"1997","unstructured":"Schwerin, P., W\u00e4scher, G.: The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. Int. Trans. Oper. Res. 4(5\u20136), 377\u2013389 (1997)","journal-title":"Int. Trans. Oper. Res."},{"key":"48_CR19","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(3), 131\u2013144 (1996)","DOI":"10.1007\/BF01539705"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2025: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7081-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T06:45:05Z","timestamp":1771742705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7081-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819570805","9789819570812"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7081-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wellington","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"17 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}