{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T19:49:26Z","timestamp":1768420166646,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031216855","type":"print"},{"value":"9783031216862","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21686-2_35","type":"book-chapter","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T08:30:15Z","timestamp":1668760215000},"page":"504-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Grammar-based Genetic Programming Hyper-Heuristic for\u00a0Corridor Allocation Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3900-2869","authenticated-orcid":false,"given":"Rafael F. R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2012-7802","authenticated-orcid":false,"given":"Heder S.","family":"Bernardino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9227-9202","authenticated-orcid":false,"given":"Jo\u00e3o M.","family":"de Freitas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3479-442X","authenticated-orcid":false,"given":"St\u00eanio S. R. F.","family":"Soares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8947-1607","authenticated-orcid":false,"given":"Luciana B.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5335-6252","authenticated-orcid":false,"given":"Lorenza L. O.","family":"Moreno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2013.07.010","volume":"232","author":"H Ahonen","year":"2014","unstructured":"Ahonen, H., de Alvarenga, A.G., Amaral, A.R.: Simulated annealing and tabu search approaches for the corridor allocation problem. Eur. J. Oper. Res. 232(1), 221\u2013233 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1287\/opre.1080.0548","volume":"56","author":"AR Amaral","year":"2008","unstructured":"Amaral, A.R.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026\u20131033 (2008)","journal-title":"Oper. Res."},{"issue":"12","key":"35_CR3","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1016\/j.cor.2012.04.016","volume":"39","author":"AR Amaral","year":"2012","unstructured":"Amaral, A.R.: The corridor allocation problem. Comput. Oper. Res. 39(12), 3325\u20133330 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"35_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"MF Anjos","year":"2005","unstructured":"Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discret. Optim."},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/ijoc.1080.0270","volume":"20","author":"MF Anjos","year":"2008","unstructured":"Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611\u2013617 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4\u20135","key":"35_CR6","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/10556780902917735","volume":"24","author":"MF Anjos","year":"2009","unstructured":"Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Meth. Softw. 24(4\u20135), 805\u2013817 (2009)","journal-title":"Optim. Meth. Softw."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Barbosa, H.J.C., Bernardino, H.S., Barreto, A.M.S.: Using performance profiles to analyze the results of the 2006 CEC constrained optimization competition. In: Evolutionary Computation (CEC), 2010 IEEE Congress on, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586105"},{"issue":"12","key":"35_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."},{"key":"35_CR9","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"EK Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. Intelligent Systems Reference Library, vol. 1, pp. 177\u2013201. Springer, Berlin Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01799-5_6"},{"key":"35_CR10","unstructured":"Cellin, B.D.P.: M\u00e9todos para Resolu\u00e7\u00e3o eficiente de Problemas de Layout. Master\u2019s thesis, Universidade Federal do Esp\u00edrito Santo, Vit\u00f3ria (2017)"},{"issue":"3","key":"35_CR11","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/00207540802192126","volume":"48","author":"J Chung","year":"2010","unstructured":"Chung, J., Tanchoco, J.: The double row layout problem. Int. J. Prod. Res. 48(3), 709\u2013727 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"de Freitas, J.M., de Souza, F.R., Bernardino, H.S.: Evolving controllers for mario AI using grammar-based genetic programming. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477698"},{"key":"35_CR14","unstructured":"Ghosh, D., Kothari, R.: Population heuristics for the corridor allocation problem. Technical report, Indian Institute of Management at Ahmedabad, Research and Publication Department (2012)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Harris, S., Bueter, T., Tauritz, D.R.: A comparison of genetic programming variants for hyper-heuristics. In: Proceedings of the Companion Publication of the Conference on Genetic and Evolutionary Computation, pp. 1043\u20131050 (2015)","DOI":"10.1145\/2739482.2768456"},{"issue":"3","key":"35_CR16","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.ejor.2021.03.027","volume":"295","author":"A Herr\u00e1n","year":"2021","unstructured":"Herr\u00e1n, A., Colmenar, J.M., Duarte, A.: An efficient variable neighborhood search for the space-free multi-row facility layout problem. Eur. J. Oper. Res. 295(3), 893\u2013907 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10732-013-9234-x","volume":"20","author":"R Kothari","year":"2014","unstructured":"Kothari, R., Ghosh, D.: A scatter search algorithm for the single row facility layout problem. J. Heuristics 20(2), 125\u2013142 (2014)","journal-title":"J. Heuristics"},{"key":"35_CR18","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press, Cambridge (1992)"},{"issue":"3","key":"35_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0377-2217(87)90238-4","volume":"29","author":"A Kusiak","year":"1987","unstructured":"Kusiak, A., Heragu, S.S.: The facility layout problem. Eur. J. Oper. Res. 29(3), 229\u2013251 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"35_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2011.04.018","volume":"214","author":"M Lozano","year":"2011","unstructured":"Lozano, M., Molina, D., Garc\u00eda-Mart\u00ednez, C.: Iterated greedy for the maximum diversity problem. Eur. J. Oper. Res. 214(1), 31\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"35_CR21","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1287\/opre.17.5.812","volume":"17","author":"DM Simmons","year":"1969","unstructured":"Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812\u2013826 (1969)","journal-title":"Oper. Res."},{"key":"35_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. John Wiley, Hoboken (2009)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Whigham, P.A.: Grammatically-based genetic programming. In: Rosca, J.P. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pp. 33\u201341. University of Rochester, Tahoe City, USA (1995)","DOI":"10.1049\/cp:19951092"},{"issue":"5","key":"35_CR24","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1108\/01443579710167212","volume":"17","author":"T Yang","year":"1997","unstructured":"Yang, T., Peters, B.A.: A spine layout design method for semiconductor fabrication facilities containing automated material-handling systems. Int. J. Oper. Prod. Manage. 17(5), 490\u2013501 (1997)","journal-title":"Int. J. Oper. Prod. Manage."}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21686-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T01:14:52Z","timestamp":1728436492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21686-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031216855","9783031216862"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21686-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Campinas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","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":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www2.sbc.org.br\/bracis2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"225","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":"89","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":"40% - 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":"3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}