{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:44:36Z","timestamp":1743039876368,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030490751"},{"type":"electronic","value":"9783030490768"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-49076-8_30","type":"book-chapter","created":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T23:04:52Z","timestamp":1592348692000},"page":"318-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Preliminary Study on Score-Based Hyper-heuristics for Solving the Bin Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0394-5555","authenticated-orcid":false,"given":"A.","family":"Silva-G\u00e1lvez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6357-4680","authenticated-orcid":false,"given":"E.","family":"Lara-C\u00e1rdenas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"I.","family":"Amaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4494-7864","authenticated-orcid":false,"given":"J. M.","family":"Cruz-Duarte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"J. C.","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,17]]},"reference":[{"issue":"5\u20136","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1007\/s00779-018-1132-7","volume":"22","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset, M., Manogaran, G., Abdel-Fatah, L., Mirjalili, S.: An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems. Pers. Ubiquit. Comput. 22(5\u20136), 1117\u20131132 (2018). https:\/\/doi.org\/10.1007\/s00779-018-1132-7","journal-title":"Pers. Ubiquit. Comput."},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-99259-4_30","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"I Amaya","year":"2018","unstructured":"Amaya, I., Ortiz-Bayliss, J.C., Conant-Pablos, S.E., Terashima-Mar\u00edn, H., Coello Coello, C.A.: Tailoring instances of the 1D bin packing problem for assessing strengths and weaknesses of its solvers. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 373\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_30"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.eswa.2016.07.005","volume":"63","author":"S Asta","year":"2016","unstructured":"Asta, S., \u00d6zcan, E., Parkes, A.J.: CHAMP: creating heuristics via many parameters for online bin packing. Expert Syst. Appl. 63, 208\u2013221 (2016)","journal-title":"Expert Syst. Appl."},{"key":"30_CR4","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, 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2018.01.005","volume":"436","author":"SS Choong","year":"2018","unstructured":"Choong, S.S., Wong, L.P., Lim, C.P.: Automatic design of hyper-heuristic based on reinforcement learning. Inf. Sci. 436, 89\u2013107 (2018)","journal-title":"Inf. Sci."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11554028_91","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"A Cuesta-Ca\u00f1ada","year":"2005","unstructured":"Cuesta-Ca\u00f1ada, A., Garrido, L., Terashima-Mar\u00edn, H.: Building hyper-heuristics through ant colony optimization for the 2D bin packing problem. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 654\u2013660. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554028_91"},{"issue":"1","key":"30_CR7","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":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-55453-2_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"JH Drake","year":"2017","unstructured":"Drake, J.H., Swan, J., Neumann, G., \u00d6zcan, E.: Sparse, continuous policy representations for uniform online bin packing via regression of interpolants. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 189\u2013200. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_13"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-92198-3_7","volume-title":"Pattern Recognition","author":"B Duhart","year":"2018","unstructured":"Duhart, B., Camarena, F., Ortiz-Bayliss, J.C., Amaya, I., Terashima-Mar\u00edn, H.: An experimental study on ant colony optimization hyper-heuristics for solving the Knapsack problem. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-L\u00f3pez, J.A., Sarkar, S. (eds.) MCPR 2018. LNCS, vol. 10880, pp. 62\u201371. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92198-3_7"},{"issue":"1","key":"30_CR10","first-page":"11","volume":"1","author":"U Eliiyi","year":"2009","unstructured":"Eliiyi, U., Eliiyi, D.T.: Applications of bin packing models through the supply chain. Int. J. Bus. Manag. 1(1), 11\u201319 (2009)","journal-title":"Int. J. Bus. Manag."},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/3-540-46135-3_35","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"SL Epstein","year":"2002","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 525\u2013540. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_35"},{"issue":"1","key":"30_CR12","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"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Garza-Santisteban, F., et al.: A simulated annealing hyper-heuristic for job shop scheduling problems. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 57\u201364, June 2019","DOI":"10.1109\/CEC.2019.8790296"},{"key":"30_CR14","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3D bin packing problem with deep reinforcement learning method. arXiv preprint, August 2017"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: MIPLIB 2010. Math. Programm. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Programm. Comput."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-33749-0_13","volume-title":"Advances in Soft Computing","author":"E Lara-C\u00e1rdenas","year":"2019","unstructured":"Lara-C\u00e1rdenas, E., S\u00e1nchez-D\u00edaz, X., Amaya, I., Ortiz-Bayliss, J.C.: Improving hyper-heuristic performance for job shop scheduling problems using neural networks. In: Mart\u00ednez-Villase\u00f1or, L., Batyrshin, I., Mar\u00edn-Hern\u00e1ndez, A. (eds.) MICAI 2019. LNCS (LNAI), vol. 11835, pp. 150\u2013161. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33749-0_13"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-11230-5_9","volume-title":"Instance-Specific Algorithm Configuration","author":"Y Malitsky","year":"2014","unstructured":"Malitsky, Y.: Evolving instance-specific algorithm configuration. In: Malitsky, Y. (ed.) Instance-Specific Algorithm Configuration, pp. 93\u2013105. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11230-5_9"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.procs.2015.12.291","volume":"76","author":"JB Odili","year":"2015","unstructured":"Odili, J.B., Kahar, M.N.M., Anwar, S.: African buffalo optimization: a swarm-intelligence technique. Procedia Comput. Sci. 76, 443\u2013448 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"30_CR19","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-47217-1_6","volume-title":"Computer and Information Sciences","author":"SO Ozcan","year":"2016","unstructured":"Ozcan, S.O., Dokeroglu, T., Cosar, A., Yazici, A.: A novel grouping genetic algorithm for the one-dimensional bin packing problem on gpu. In: Czach\u00f3rski, T., Gelenbe, E., Grochla, K., Lent, R. (eds.) ISCIS 2016. CCIS, vol. 659, pp. 52\u201360. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47217-1_6"},{"key":"30_CR20","series-title":"NCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7_13","volume-title":"Hyper-Heuristics: Theory and Applications","author":"N Pillay","year":"2018","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. NCS. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7_13"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32964-7_35","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"K Sim","year":"2012","unstructured":"Sim, K., Hart, E., Paechter, B.: A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7492, pp. 348\u2013357. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32964-7_35"},{"issue":"1","key":"30_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1162\/EVCO_a_00121","volume":"23","author":"K Sim","year":"2015","unstructured":"Sim, K., Hart, E., Paechter, B.: A lifelong learning hyper-heuristic method for bin packing. Evol. Comput. 23(1), 37\u201367 (2015)","journal-title":"Evol. Comput."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, M., Lan, Y., Li, H.: A new bin packing algorithm with buffer. In: 2018 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS), pp. 625\u2013628. IEEE, January 2018","DOI":"10.1109\/ICITBS.2018.00163"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49076-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T23:05:45Z","timestamp":1718579145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-49076-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030490751","9783030490768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49076-8_30","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":"17 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morelia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ccc.inaoep.mx\/~mcpr2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.79","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}