IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v332y2024i1d10.1007_s10479-023-05492-2.html
   My bibliography  Save this article

Expanding students’ social networks via optimized team assignments

Author

Listed:
  • Alessandro Hill

    (California Polytechnic State University)

  • Steffen Peuker

    (California Polytechnic State University)

Abstract

The class social network is a momentous factor when it comes to educational, personal and professional student success as well as achieving course learning outcomes. Students and teachers benefit from expanded network connectivity via augmented engagement, more inclusivity, and efficient diffusion of information. We present a novel method for positively influencing the class social network. We develop an in-class grouping strategy based on optimization and sociocentric network analysis that pragmatically expands the students’ social networks. In contrast to existing routines, our technique focuses on maximizing individual student opportunities to establish new ties. Based on the knowledge of existing connections, our procedure systematically optimizes the overall number of new ties that can be established during a team project. Our data-driven approach is designed for practical use in class. We show that the underlying combinatorial problem of maximizing unrelated intra-team students can be modeled as a bin packing variant. Using an integer programming formulation, we demonstrate the efficient spreadsheet implementation. We discuss model extensions to account for high-density networks, team balancing, and teammate forcing and forbidding, allowing for hybridization using existing grouping techniques. In an empirical study, we provide evidence for the efficacy of our approach using data from 10 industrial engineering classes with 253 students and 77 project teams - in both face-to-face and virtual modes. We demonstrate the impact of our grouping method compared to random-assignment, self-selection, and maximizing existing intra-team ties. We report an impressive 62% increase of ties compared to only 17% when self-assigning.

Suggested Citation

  • Alessandro Hill & Steffen Peuker, 2024. "Expanding students’ social networks via optimized team assignments," Annals of Operations Research, Springer, vol. 332(1), pages 1107-1131, January.
  • Handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-023-05492-2
    DOI: 10.1007/s10479-023-05492-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05492-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-023-05492-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ruslan Sadykov & François Vanderbeck, 2013. "Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 244-255, May.
    2. William G. Shepherd, 1965. "Operations Research in Education," Management Science, INFORMS, vol. 11(4), pages 13-19, February.
    3. M Gallego & M Laguna & R Martí & A Duarte, 2013. "Tabu search with strategic oscillation for the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(5), pages 724-734, May.
    4. Gintaras Palubeckis & Armantas Ostreika & Dalius Rubliauskas, 2015. "Maximally diverse grouping: an iterated tabu search approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(4), pages 579-592, April.
    5. Gergely Palla & Albert-László Barabási & Tamás Vicsek, 2007. "Quantifying social group evolution," Nature, Nature, vol. 446(7136), pages 664-667, April.
    6. Theresa M. Roeder & Robert M. Saltzman, 2014. "Schedule-Based Group Assignment Using Constraint Programming," INFORMS Transactions on Education, INFORMS, vol. 14(2), pages 63-72, February.
    7. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    8. Schulz, Arne, 2021. "The balanced maximally diverse grouping problem with block constraints," European Journal of Operational Research, Elsevier, vol. 294(1), pages 42-53.
    9. Kaj Holmberg, 2019. "Formation of student groups with the help of optimisation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(9), pages 1538-1553, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Arne Schulz, 2024. "Efficient neighborhood evaluation for the maximally diverse grouping problem," Annals of Operations Research, Springer, vol. 341(2), pages 1247-1265, October.
    2. Arne Schulz, 2022. "A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values," Annals of Operations Research, Springer, vol. 318(1), pages 501-530, November.
    3. Schulz, Arne, 2021. "The balanced maximally diverse grouping problem with block constraints," European Journal of Operational Research, Elsevier, vol. 294(1), pages 42-53.
    4. Yang, Xiao & Cai, Zonghui & Jin, Ting & Tang, Zheng & Gao, Shangce, 2022. "A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 925-953.
    5. Lai, Xiangjing & Hao, Jin-Kao & Fu, Zhang-Hua & Yue, Dong, 2021. "Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1067-1086.
    6. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    7. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    8. Lai, Xiangjing & Hao, Jin-Kao, 2016. "Iterated maxima search for the maximally diverse grouping problem," European Journal of Operational Research, Elsevier, vol. 254(3), pages 780-800.
    9. Fleszar, Krzysztof, 2022. "A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation," European Journal of Operational Research, Elsevier, vol. 303(1), pages 37-53.
    10. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    11. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    12. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    13. Andrea Bettinelli & Valentina Cacchiani & Enrico Malaguti, 2017. "A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 457-473, August.
    14. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    15. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    16. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    17. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    18. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    19. Wilhelm, Thomas & Hollunder, Jens, 2007. "Information theoretic description of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 385(1), pages 385-396.
    20. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-023-05492-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.