{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:46:13Z","timestamp":1726101973340},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030615338"},{"type":"electronic","value":"9783030615345"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61534-5_25","type":"book-chapter","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T04:04:34Z","timestamp":1603166674000},"page":"277-289","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0014-4288","authenticated-orcid":false,"given":"Derrick","family":"Beckedahl","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3902-5582","authenticated-orcid":false,"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/b:heur.0000026267.44673.ed","volume":"10","author":"AC Alvim","year":"2004","unstructured":"Alvim, A.C., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10(2), 205\u2013229 (2004). \nhttps:\/\/doi.org\/10.1023\/b:heur.0000026267.44673.ed","journal-title":"J. Heuristics"},{"key":"25_CR2","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."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cie.2014.06.002","volume":"75","author":"T Dokeroglu","year":"2014","unstructured":"Dokeroglu, T., Cosar, A.: Optimization of one-dimensional bin packing problem with island parallel grouping genetic algorithms. Comput. Ind. Eng. 75, 176\u2013186 (2014). \nhttps:\/\/doi.org\/10.1016\/j.cie.2014.06.002","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"25_CR4","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). \nhttps:\/\/doi.org\/10.1007\/bf00226291","journal-title":"J. Heuristics"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"Fleszar, K., Charalambous, C.: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur. J. Oper. Res. 210(2), 176\u2013184 (2011). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2010.11.004","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","volume":"125","author":"T Kucukyilmaz","year":"2018","unstructured":"Kucukyilmaz, T., Kiziloz, H.E.: Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput. Ind. Eng. 125, 157\u2013170 (2018). \nhttps:\/\/doi.org\/10.1016\/j.cie.2018.08.021","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"25_CR7","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1057\/palgrave.jors.2601771","volume":"55","author":"J Levine","year":"2004","unstructured":"Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. J. Oper. Res. Soc. 55(7), 705\u2013716 (2004). \nhttps:\/\/doi.org\/10.1057\/palgrave.jors.2601771","journal-title":"J. Oper. Res. Soc."},{"issue":"15","key":"25_CR8","doi-asserted-by":"publisher","first-page":"6876","DOI":"10.1016\/j.eswa.2014.04.043","volume":"41","author":"E L\u00f3pez-Camacho","year":"2014","unstructured":"L\u00f3pez-Camacho, E., Terashima-Marin, H., Ross, P., Ochoa, G.: A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl. 41(15), 6876\u20136889 (2014). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2014.04.043","journal-title":"Expert Syst. Appl."},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Pillay, N., Beckedahl, D.: EvoHyp - a Java toolkit for evolutionary algorithm hyper-heuristics. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2706\u20132713, June 2017. \nhttps:\/\/doi.org\/10.1109\/CEC.2017.7969636","DOI":"10.1109\/CEC.2017.7969636"},{"key":"25_CR10","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7","volume-title":"Hyper-Heuristics: Theory and Applications","author":"N Pillay","year":"2018","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. Natural Computing Series. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96514-7"},{"issue":"9","key":"25_CR11","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). \nhttps:\/\/doi.org\/10.1057\/jors.2008.102","journal-title":"J. Oper. Res. Soc."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J.S., Gomez, C.G., Huacuja, H.J.F., Alvim, A.C.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015). \nhttps:\/\/doi.org\/10.1016\/j.cor.2014.10.010","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"25_CR13","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). \nhttps:\/\/doi.org\/10.1016\/s0305-0548(96)00082-2","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61534-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T04:28:45Z","timestamp":1603168125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61534-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030615338","9783030615345"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61534-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 October 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}