{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T19:20:04Z","timestamp":1771788004856,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031234798","type":"print"},{"value":"9783031234804","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23480-4_17","type":"book-chapter","created":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T09:09:35Z","timestamp":1674464975000},"page":"206-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bi-Space Search: Optimizing the\u00a0Hybridization of\u00a0Search Spaces in\u00a0Solving the\u00a0One Dimensional Bin Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0014-4288","authenticated-orcid":false,"given":"Derrick","family":"Beckedahl","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"}]}],"member":"297","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Bai, R., Blazewicz, J., Burke, E.K., Kendall, G., McCollum, B.: A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR 10(1), 43\u201366 (2012)","DOI":"10.1007\/s10288-011-0182-8"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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.) ICAISC 2020. LNCS (LNAI), vol. 12416, pp. 277\u2013289. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61534-5_25"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.06.009","volume":"76","author":"M Buljuba\u0161i\u0107","year":"2016","unstructured":"Buljuba\u0161i\u0107, M., Vasquez, M.: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput. Oper. Res. 76, 12\u201321 (2016)","journal-title":"Comput. Oper. Res."},{"key":"17_CR4","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"17_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. Heurist. 2(1), 5\u201330 (1996)","journal-title":"J. Heurist."},{"issue":"7","key":"17_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. Operat. Res. 29(7), 821\u2013839 (2002)","journal-title":"Comput. Operat. Res."},{"key":"17_CR7","unstructured":"Koza, J.R.: Genetic Programming On the Programming of Computers by Means of Natural Selection. MIT (1992)"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. Natural Computing Series, Springer International Publishing (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7","DOI":"10.1007\/978-3-319-96514-7"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., G\u00f3mez S., C., Huacuja, H.J.F., Alvim, A.C.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Operat. Res. 55, 52\u201364 (2015)","DOI":"10.1016\/j.cor.2014.10.010"},{"key":"17_CR10","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-64403-5_3","volume-title":"Introduction to Cutting and Packing Optimization","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G.: one-dimensional bin packing. In: Introduction to Cutting and Packing Optimization. ISORMS, vol. 263, pp. 47\u201372. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-64403-5_3"},{"key":"17_CR11","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":"17_CR12","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. Operat. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Operat. Res."},{"issue":"5\u20136","key":"17_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1111\/j.1475-3995.1997.tb00093.x","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":"17_CR14","doi-asserted-by":"crossref","unstructured":"W\u00e4scher, G., Gau, T.: Heuristics for the integer one-dimensional cutting stock problem: A computational study. Operat. Res. Spektrum 18(3), 131\u2013144 (1996)","DOI":"10.1007\/BF01539705"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23480-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T09:12:18Z","timestamp":1674465138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23480-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031234798","9783031234804"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23480-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}