Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach

Eduardo Canale, Franco Robledo, Pablo Sartor, Luis Stábile
2021 Symmetry  
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or
more » ... ng—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.
doi:10.3390/sym14010018 fatcat:jncnxgrkqnfvnipcehzmm2mu5a