An empirical comparison of heuristic methods for creating maximally diverse groups

This research identifies, describes, and empirically contrasts five heuristics for forming maximally diverse groups of any specified size from a given population. Diversity is based upon multiple criteria specified by the decision maker. The problem has immediate application in academic or training settings where it may be desired to create class sections, or project groups within classes, such that students are immersed in a diverse environment. Furthermore this research has an even broader utility, as the problem is mathematically identical to an eclectic set of applications ranging from final exam scheduling to VLSI design. Here we consider five different heuristics, drawn from student-workgroup assignment and final exam scheduling applications. The methods are tested on a ‘real-world’ data set and evaluated on the criteria of solution quality and computational resources.

[1]  V. Lotfi,et al.  A Three Phased Approach To Final Exam Scheduling , 1989 .

[2]  Jeremy B. Fox,et al.  An Investigation into the People‐Sequential Heuristic Method of Group Formation , 1993 .

[3]  Vahid Lotfi,et al.  A Final-Exam-Scheduling Package , 1991 .

[4]  Gary R. Reeves,et al.  Assigning MBA Students to Field Study Project Teams: A Multicriteria Approach , 1992 .

[5]  Katsuhisa Ohno,et al.  Solution method for partitioning students into groups , 1988 .

[6]  John Mingers,et al.  Creating student groups with similar characteristics: A heuristic approach , 1995 .

[7]  N. Singh,et al.  Design of cellular manufacturing systems: An invited review , 1993 .

[8]  Mo Adam Mahmood,et al.  Education DEVELOPMENT AND VALIDATION OF A TOOL FOR ASSIGNING STUDENTS TO GROUPS FOR CLASS PROJECTS , 1986 .

[9]  Thomas A. Feo,et al.  One-Half Approximation Algorithms for the k-Partition Problem , 1992, Oper. Res..

[10]  Arthur V. Hill,et al.  SCAT AND SPAT: LARGE‐SCALE COMPUTER‐BASED OPTIMIZATION SYSTEMS FOR THE PERSONNEL ASSIGNMENT PROBLEM , 1983 .

[11]  F. Glover,et al.  Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* , 1993 .

[12]  R. R. Weitz,et al.  An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling , 1997 .

[13]  R. R. Weitz,et al.  On a Heuristic for the Final Exam Scheduling Problem , 1996 .

[14]  Rob R. Weitz,et al.  Assigning Students to Groups: A Multi‐Criteria Decision Support System Approach* , 1992 .

[15]  Thomas E. Muller Assigning Students to Groups for Class Projects: An Exploratory Test of Two Methods , 1989 .