{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:49:13Z","timestamp":1775836153560,"version":"3.50.1"},"reference-count":22,"publisher":"Sociedade Brasileira de Computacao - SB","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RBIE"],"abstract":"<jats:p>Alocar estudantes em escolas p\u00fablicas \u00e9 um desafio log\u00edstico e social com efeitos diretos sobre equidade, acesso e qualidade educacional, especialmente em contextos de demanda desigual e restri\u00e7\u00f5es de capacidade. Este artigo apresenta uma revis\u00e3o bibliogr\u00e1fica sobre sistemas de aloca\u00e7\u00e3o de estudantes em escolas, cobrindo o per\u00edodo de 2014 a 2024. A revis\u00e3o contempla estudos nacionais e internacionais que prop\u00f5em diferentes abordagens para o problema, incluindo modelos baseados em prefer\u00eancias, dist\u00e2ncia, capacidade das escolas e composi\u00e7\u00e3o socioecon\u00f4mica. Tamb\u00e9m s\u00e3o analisados os principais algoritmos utilizados, como casamento est\u00e1vel, m\u00e9todos heur\u00edsticos e meta-heur\u00edsticos, entre outros. A s\u00edntese evidencia objetivos recorrentes, como minimiza\u00e7\u00e3o de dist\u00e2ncias e custos, estabilidade das aloca\u00e7\u00f5es e ocupa\u00e7\u00e3o eficiente, e discute barreiras pr\u00e1ticas: qualidade e integra\u00e7\u00e3o de dados, transpar\u00eancia de regras, aceita\u00e7\u00e3o social, desigualdades territoriais e custos computacionais em larga escala. Com isso, busca-se oferecer uma vis\u00e3o abrangente sobre as solu\u00e7\u00f5es propostas e suas implica\u00e7\u00f5es para a formula\u00e7\u00e3o de pol\u00edticas p\u00fablicas mais justas e eficientes no campo educacional.<\/jats:p>","DOI":"10.5753\/rbie.2026.6639","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:08:17Z","timestamp":1775833697000},"page":"458-477","source":"Crossref","is-referenced-by-count":0,"title":["Sistemas de Aloca\u00e7\u00e3o de Estudantes em Escolas: Uma Revis\u00e3o Sistem\u00e1tica da Literatura"],"prefix":"10.5753","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5228-1583","authenticated-orcid":false,"given":"Anderson Pinheiro","family":"Cavalcanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0818-3034","authenticated-orcid":false,"given":"Samara Monteiro","family":"Xavier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2461-8291","authenticated-orcid":false,"given":"Juliana Maria da Silva","family":"Ven\u00e2ncio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5767-7544","authenticated-orcid":false,"given":"P\u00e9ricles Barbosa Cunha de","family":"Miranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9333-3212","authenticated-orcid":false,"given":"Andr\u00e9 C\u00e2mara Alves do","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3548-9670","authenticated-orcid":false,"given":"Rafael Ferreira Leite de","family":"Mello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"3742","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"1","unstructured":"Ali, A. Y. (2021). Greedy algorithm for solving student allocation problem in internship program: a case study. International journal of research in industrial engineering, 10(2), 155\u2013164. <a href=\"https:\/\/doi.org\/10.22105\/riej.2021.266125.1179\">https:\/\/doi.org\/10.22105\/riej.2021.266125.1179<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Greedy+algorithm+for+solving+student+allocation+problem+in+internship+program%3A+a+case+study&btnG=\">GS Search<\/a>]."},{"key":"2","doi-asserted-by":"crossref","unstructured":"Alifi, M. R., Hayati, H., & Supangkat, S. H. (2017). Optimization of school network using location-allocation analysis: Case study: Bandung, Indonesia. 2017 IEEE Region 10 Symposium (TENSYMP), 1\u20136. <a href=\"https:\/\/doi.org\/10.1109\/TENCONSpring.2017.8070099\">https:\/\/doi.org\/10.1109\/TENCONSpring.2017.8070099<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Optimization+of+school+network+using+location-allocation+analysis%3A+Case+study%3A+Bandung%2C+Indonesia&btnG=\">GS Search<\/a>].","DOI":"10.1109\/TENCONSpring.2017.8070099"},{"key":"3","doi-asserted-by":"crossref","unstructured":"Arnosti, N. (2023). Lottery design for school choice. Management Science, 69(1), 244\u2013259. <a href=\"https:\/\/doi.org\/10.1287\/mnsc.2022.4338\">https:\/\/doi.org\/10.1287\/mnsc.2022.4338<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Lottery+design+for+school+choice+Arnosti&btnG=\">GS Search<\/a>].","DOI":"10.1287\/mnsc.2022.4338"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Badoni, R. P., & Gupta, D. (2015). A new algorithm based on students groupings for university course timetabling problem. 2015 2nd international conference on recent advances in engineering & computational sciences (RAECS), 1\u20135. <a href=\"https:\/\/doi.org\/10.1109\/RAECS.2015.7453340\">https:\/\/doi.org\/10.1109\/RAECS.2015.7453340<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=A+new+algorithm+based+on+students+groupings+for+university+course+timetabling+problem&btnG=\">GS Search<\/a>].","DOI":"10.1109\/RAECS.2015.7453340"},{"key":"5","doi-asserted-by":"crossref","unstructured":"Bouzarth, E. L., Forrester, R., Hutson, K. R., & Reddoch, L. (2018). Assigning students to schools to minimize both transportation costs and socioeconomic variation between schools. Socio-Economic Planning Sciences, 64, 1\u20138. <a href=\"https:\/\/doi.org\/10.1016\/j.seps.2017.09.001\">https:\/\/doi.org\/10.1016\/j.seps.2017.09.001<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Assigning+students+to+schools+to+minimize+both+transportation+costs+and+socioeconomic+variation+between+schools&btnG=\">GS Search<\/a>].","DOI":"10.1016\/j.seps.2017.09.001"},{"key":"6","unstructured":"Delgado, V. M. S. (2013). Aloca\u00e7\u00e3o dos alunos nas escolas: uma abordagem de algoritmos de pareamento para an\u00e1lise do efeito do cadastro escolar de Belo Horizonte na profici\u00eancia dos estudantes. [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=oca%C3%A7%C3%A3o+dos+alunos+nas+escolas%3A+uma+abordagem+de+algoritmos+de+pareamento+para+an%C3%A1lise+do+efeito+do+cadastro+escolar+de+Belo+Horizonte+na+profici%C3%AAncia+dos+estudantes&btnG=\">GS Search<\/a>] [<a href=\"https:\/\/repositorio.ufmg.br\/items\/f438dd9c-bfde-4e67-be30-b33c057ef267\">Link<\/a>]."},{"key":"7","doi-asserted-by":"crossref","unstructured":"Fernandes, G. A. A. L. (2018). O problema das matr\u00edculas escolares: uma discuss\u00e3o sobre a melhoria das regras utilizadas em S\u00e3o Paulo. Revista de Administra\u00e7\u00e3o P\u00fablica, 52(4), 740\u2013752. <a href=\"https:\/\/doi.org\/10.1590\/0034-7612163466\">https:\/\/doi.org\/10.1590\/0034-7612163466<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=problema+das+matr%C3%ADculas+escolares%3A+uma+discuss%C3%A3o+sobre+a+melhoria+das+regras+utilizadas+em+S%C3%A3o+Paulo.&btnG=\">GS Search<\/a>].","DOI":"10.1590\/0034-7612163466"},{"key":"8","doi-asserted-by":"crossref","unstructured":"Ilham, M. N., Arbansyah, A., Suryawan, S. H., & Wirayuda, P. (2020). Application of Bubble Sort Optimization in New Student Admission Selection Using Brute Force Algorithm. Tepian, 5(2), 568771. <a href=\"https:\/\/doi.org\/10.51967\/tepian.v5i2.3055\">https:\/\/doi.org\/10.51967\/tepian.v5i2.3055<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Application+of+Bubble+Sort+Optimization+in+New+Student+Admission+Selection+Using+Brute+Force+Algorithm&btnG=\">GS Search<\/a>].","DOI":"10.51967\/tepian.v5i2.3055"},{"key":"9","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Li, B., & Zhao, R. (2019). An allocation scheme of students based on IPM under the nearby enrollment policy. 2019 10th International Conference on Information Technology in Medicine and Education (ITME), 260\u2013264. <a href=\"https:\/\/doi.org\/10.1109\/ITME.2019.00066\">https:\/\/doi.org\/10.1109\/ITME.2019.00066<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=An+allocation+scheme+of+students+based+on+IPM+under+the+nearby+enrollment+policy&btnG=\">GS Search<\/a>].","DOI":"10.1109\/ITME.2019.00066"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Lincolao-Venegas, I., & Rojas-Mora, J. (2024). Exploration Pitfalls in a CUDA Parallelized Simulated Annealing Algorithm to Solve the Centralized Student-School Assignment Problem. 2024 43rd International Conference of the Chilean Computer Science Society (SCCC), 1\u20138. <a href=\"https:\/\/doi.org\/10.1109\/SCCC63879.2024.10767637\">https:\/\/doi.org\/10.1109\/SCCC63879.2024.10767637<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Exploration+Pitfalls+in+a+CUDA+Parallelized+Simu-+lated+Annealing+Algorithm+to+Solve+the+Centralized+Student-School+Assignment+Problem.&btnG=\">GS Search<\/a>].","DOI":"10.1109\/SCCC63879.2024.10767637"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Machado, M. M. M., & Cardoso, S. L. (2025). O uso da Tecnologia em Sala de Aula com Alunos com TEA: uma Revis\u00e3o Sistem\u00e1tica da Literatura. Revista Brasileira de Inform\u00e1tica na Educa\u00e7\u00e3o, 33, 583\u2013604. <a href=\"https:\/\/doi.org\/10.5753\/rbie.2025.5356\">https:\/\/doi.org\/10.5753\/rbie.2025.5356<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=O+uso+da+Tecnologia+em+Sala+de+Aula+com+Alunos+com+TEA%3A+uma+Revis%C3%A3o+Sistem%C3%A1tica+da+Literatura.&btnG=\">GS Search<\/a>].","DOI":"10.5753\/rbie.2025.5356"},{"key":"12","doi-asserted-by":"crossref","unstructured":"Mayerle, S. F., Rodrigues, H. F., Figueiredo, J. N., & Chiroli, D. M. D. G. (2022). Optimal student\/school\/class\/teacher\/classroom matching to support efficient public school system resource allocation. Socio-Economic Planning Sciences, 83, 101341. <a href=\"https:\/\/doi.org\/10.1016\/j.seps.2022.101341\">https:\/\/doi.org\/10.1016\/j.seps.2022.101341<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=ptimal+student%2Fschool%2Fclass%2Fteacher%2Fclassroom+matching+to+support+efficient+public+school+system+resource+allocation&btnG=\">GS Search<\/a>].","DOI":"10.1016\/j.seps.2022.101341"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Neto, G. F., Miranda, P. B., Mello, R. F., & Nascimento, A. C. (2022). A Novel One-to-Many Matching Method for the Assignment Problem: An ENEM Case Study. Encontro Nacional de Intelig\u00eancia Artificial e Computacional (ENIAC), 164\u2013173. <a href=\"https:\/\/doi.org\/10.5753\/eniac.2022.227548\">https:\/\/doi.org\/10.5753\/eniac.2022.227548<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=+Novel+One-to-Many+Matching+Method+for+the+Assignment+Problem%3A+An+ENEM+Case+Study.&btnG=\">GS Search<\/a>].","DOI":"10.5753\/eniac.2022.227548"},{"key":"14","unstructured":"Page, M. J., McKenzie, J. E., Bossuyt, P. M., Boutron, I., Hoffmann, T. C., Mulrow, C. D., Shamseer, L., Tetzlaff, J. M., Akl, E. A., Brennan, S. E., et al. (2021). The PRISMA 2020 statement: an updated guideline for reporting systematic reviews. bmj, 372. <a href=\"https:\/\/doi.org\/10.1186\/s13643-021-01626-4\">https:\/\/doi.org\/10.1186\/s13643-021-01626-4<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=the+PRISMA+2020+statement%3A+an+updated+guideline+for+reporting+systematic+reviews&btnG=\">GS Search<\/a>]."},{"key":"15","unstructured":"Prima, P., & Arymurthy, A. M. (2018). Optimization of school location-allocation using genetic algorithm. 2018 8th International Workshop on Computer Science and Engineering, WCSE 2018, 750\u2013755. [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=optimization+of+school+location-allocation+using+gene-+tic+algorithm&btnG=\">GS Search<\/a>] [<a href=\"https:\/\/scholar.ui.ac.id\/en\/publications\/optimization-of-school-location-allocation-using-genetic-algorith\/fingerprints\/\">Link<\/a>]."},{"key":"16","doi-asserted-by":"crossref","unstructured":"Prima, P., & Arymurthy, A. M. (2019). Optimization of school location-allocation using Firefly Algorithm. Journal of Physics: Conference Series, 1235(1), 012002. <a href=\"https:\/\/doi.org\/10.1088\/1742-6596\/1235\/1\/012002\">https:\/\/doi.org\/10.1088\/1742-6596\/1235\/1\/012002<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=optimization+of+school+location-allocation+using+Firefly+Algorithm.&btnG=\">GS Search<\/a>].","DOI":"10.1088\/1742-6596\/1235\/1\/012002"},{"key":"17","doi-asserted-by":"crossref","unstructured":"Robertson, S., Nguyen, T., & Salehi, N. (2021). Modeling assumptions clash with the real world: Transparency, equity, and community challenges for student assignment algorithms. Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, 1\u201314. <a href=\"https:\/\/doi.org\/10.1145\/3411764.3445748\">https:\/\/doi.org\/10.1145\/3411764.3445748<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Modeling+assumptions+clash+with+the+real+world%3A+Transparency%2C+equity%2C+and+community+challenges+for+student+assignment+algorithms&btnG=\">GS Search<\/a>].","DOI":"10.1145\/3411764.3445748"},{"key":"18","unstructured":"Rodrigues, H. F., & Mayerle, S. F. (2014). Modelo capacitado para aloca\u00e7\u00e3o de alunos em redes p\u00fablicas de ensino. XLVI Simp\u00f3sio Brasileiro de Pesquisa Operacional. [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Modelo+capacitado+para+aloca%C3%A7%C3%A3o+de+alunos+em+redes+p%C3%BAblicas+de+ensino&btnG=\">GS Search<\/a>] [<a href=\"http:\/\/din.uem.br\/sbpo\/sbpo2014\/pdf\/arq0213.pdf\">Link<\/a>]."},{"key":"19","doi-asserted-by":"crossref","unstructured":"Rosistolato, R., Prado, A. P., Koslinski, M. C., Carvalho, J. T., & Moreira, A. M. (2016). Din\u00e2micas de matr\u00edcula em escolas p\u00fablicas na cidade do Rio de Janeiro. Pro-Posi\u00e7\u00f5es, 27, 237\u2013262. <a href=\"https:\/\/doi.org\/10.1590\/1980-6248-2015-0108\">https:\/\/doi.org\/10.1590\/1980-6248-2015-0108<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Din%C3%A2micas+de+matr%C3%ADcula+em+escolas+p%C3%BAblicas+na+cidade+do+Rio+de+Janeiro&btnG=\">GS Search<\/a>].","DOI":"10.1590\/1980-6248-2015-0108"},{"key":"20","doi-asserted-by":"crossref","unstructured":"Verhalen, L. E. C., Castro, M. M. M., & Maciel, C. (2025). Percep\u00e7\u00f5es e Ferramentas sobre Recria\u00e7\u00e3o Digital de Educadores por meio de Intelig\u00eancia Artificial: Uma Revis\u00e3o Sistem\u00e1tica de Literatura. Revista Brasileira de Inform\u00e1tica na Educa\u00e7\u00e3o, 33, 565\u2013582. <a href=\"https:\/\/doi.org\/10.5753\/rbie.2025.5279\">https:\/\/doi.org\/10.5753\/rbie.2025.5279<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Percep%C3%A7%C3%B5es+e+Ferramentas+sobre+Recri-+a%C3%A7%C3%A3o+Digital+de+Educadores+por+meio+de+Intelig%C3%AAncia+Artificial%3A+Uma+Revis%C3%A3o+Sistem%C3%A1tica+de+Literatura&btnG=\">GS Search<\/a>].","DOI":"10.5753\/rbie.2025.5279"},{"key":"21","doi-asserted-by":"crossref","unstructured":"Vianna, C. R., Teles, C. A. M. S., Pontes, R. S. G., Belloze, K. T., Cirto, F. E., Brand\u00e3o, D., Assis, L. S., & Carvalho, F. F. (2023). Heuristic for the Students Allocation in Brazilian Public Schools: a Case Study. 2023 18th Iberian Conference on Information Systems and Technologies (CISTI), 1\u20137. <a href=\"https:\/\/doi.org\/10.23919\/CISTI58278.2023.10211339\">https:\/\/doi.org\/10.23919\/CISTI58278.2023.10211339<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Heuristic+for+the+Students+Allocation+in+Brazilian+Public+Schools%3A+a+Case+Study&btnG=\">GS Search<\/a>].","DOI":"10.23919\/CISTI58278.2023.10211339"},{"key":"22","doi-asserted-by":"crossref","unstructured":"Wahid, E. A. L., Zainuddin, Z., & Ilham, A. A. (2024). Modification of K-Means Clustering Algorithm for Optimizing School Zoning System Using Big Data. 2024 7th International Conference on Information and Communications Technology (ICOIACT), 148\u2013153. <a href=\"https:\/\/doi.org\/10.1109\/ICOIACT64819.2024.10913295\">https:\/\/doi.org\/10.1109\/ICOIACT64819.2024.10913295<\/a> [<a href=\"https:\/\/scholar.google.com\/scholar?hl=pt-BR&as_sdt=0%2C5&q=Modification+of+K-Means+Clustering+Algorithm+for+Optimizing+School+Zoning+System+Using+Big+Data&btnG=\">GS Search<\/a>].","DOI":"10.1109\/ICOIACT64819.2024.10913295"}],"container-title":["Revista Brasileira de Inform\u00e1tica na Educa\u00e7\u00e3o"],"original-title":[],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:08:27Z","timestamp":1775833707000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals-sol.sbc.org.br\/index.php\/rbie\/article\/view\/6639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":22,"URL":"https:\/\/doi.org\/10.5753\/rbie.2026.6639","relation":{},"ISSN":["2317-6121","1414-5685"],"issn-type":[{"value":"2317-6121","type":"electronic"},{"value":"1414-5685","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4,7]]}}}