<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-30T05:35:44Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/11846" metadataPrefix="oai_dc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/11846</identifier><datestamp>2026-06-17T00:05:32Z</datestamp><setSpec>com_10259_3830</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_3832</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>Optimizing classroom assignments to minimize epidemiological risk: the sibling rewiring problem</dc:title>
<dc:creator>Galán Ordax, José Manuel</dc:creator>
<dc:creator>Díaz de la Fuente, Silvia</dc:creator>
<dc:creator>Ahedo García, Virginia</dc:creator>
<dc:creator>Santos Martín, José Ignacio</dc:creator>
<dc:subject>Classroom assignment</dc:subject>
<dc:subject>Sibling networks</dc:subject>
<dc:subject>Epidemic risk</dc:subject>
<dc:subject>Assignment optimization</dc:subject>
<dc:subject>Network fragmentation</dc:subject>
<dc:subject>Multi-objective optimization</dc:subject>
<dc:subject>Equitable risk distribution</dc:subject>
<dc:subject>Niños-Enfermedades</dc:subject>
<dc:subject>Algoritmos</dc:subject>
<dc:subject>Children-Diseases</dc:subject>
<dc:subject>Algorithms</dc:subject>
<dc:description>In the context of infectious diseases, the assignment of students to classroom groups&#xd;
can significantly influence infection dynamics within school environments,&#xd;
particularly when sibling relationships introduce latent connections between&#xd;
otherwise unconnected groups. Traditional grouping methods and pandemic-era&#xd;
bubble strategies do not explicitly optimize student network structures or account for&#xd;
equity in exposure. This study introduces the Sibling Rewiring Problem, a novel&#xd;
multi-objective framework for student assignment that aims to maximize network&#xd;
fragmentation, reduce potential contagion pathways and minimize variance in group&#xd;
sizes and epidemiological exposure—thereby promoting fairness. We compared&#xd;
baseline, heuristic, and metaheuristic strategies in realistic school scenarios. A simple&#xd;
heuristic that assigns siblings to the same classroom line when feasible consistently&#xd;
achieves substantial network fragmentation with minimal impact on equity.&#xd;
Simulated Annealing further improved these results, particularly in complex&#xd;
configurations with densely connected sibling networks. Our findings suggest that&#xd;
family-aware classroom assignments can enhance epidemiological resilience while&#xd;
maintaining socially acceptable distributions. This approach provides a practical and&#xd;
scalable framework for integrating public health considerations into educational&#xd;
planning and may inform future decision-making in both emergency and routine&#xd;
contexts</dc:description>
<dc:description>This research was supported by the Ministry of Science and Innovation through its excellence network RED2022-134890-T, the project PID2020118906GB-I00, and the MOMENTUM program project MMT24-IMF-02. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript</dc:description>
<dc:date>2026-06-16T07:46:11Z</dc:date>
<dc:date>2026-06-16T07:46:11Z</dc:date>
<dc:date>2026-03</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:identifier>https://hdl.handle.net/10259/11846</dc:identifier>
<dc:identifier>10.7717/peerj-cs.3710</dc:identifier>
<dc:identifier>2376-5992</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>PeerJ Computer Science. 2026, V. 12, art. e3710</dc:relation>
<dc:relation>https://doi.org/10.7717/peerj-cs.3710</dc:relation>
<dc:rights>Atribución 4.0 Internacional</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:format>application/pdf</dc:format>
<dc:publisher>PeerJ Inc.</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>