A hybrid genetic algorithmic approach to the maximally diverse grouping problem

The maximally diverse grouping problem (MDGP) is a NP-complete problem. For such NP-complete problems, heuristics play a major role in searching for solutions. Most of the heuristics for MDGP focus on the equal group-size situation. In this paper, we develop a genetic algorithm (GA)-based hybrid heuristic to solve this problem considering not only the equal group-size situation but also the different group-size situation. The performance of the algorithm is compared with the established Lotfi–Cerveny–Weitz algorithm and the non-hybrid GA. Computational experience indicates that the proposed GA-based hybrid algorithm is a good tool for solving MDGP. Moreover, it can be easily modified to solve other equivalent problems.

[1]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[4]  Thomas A. Feo,et al.  A class of bounded approximation algorithms for graph partitioning , 1990, Networks.

[5]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[6]  Zahra Naji Azimi,et al.  Hybrid heuristics for Examination Timetabling problem , 2005, Appl. Math. Comput..

[7]  Barrie M. Baker,et al.  Assigning pupils to tutor groups in a comprehensive school , 2001, J. Oper. Res. Soc..

[8]  L. D. Whitley,et al.  The Traveling Salesman and Sequence Scheduling : , 1990 .

[9]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[10]  Hsiao-Fan Wang,et al.  Hybrid genetic algorithm for optimization problems with permutation property , 2004, Comput. Oper. Res..

[11]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[12]  R. R. Weitz,et al.  An empirical comparison of heuristic methods for creating maximally diverse groups , 1998, J. Oper. Res. Soc..

[13]  F. J. Vasko,et al.  An empirical study of hybrid genetic algorithms for the set covering problem , 2005, J. Oper. Res. Soc..

[14]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[15]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..

[16]  John A. Miller,et al.  An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..

[17]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[18]  Hsiao-Fan Wang,et al.  Modeling and analysis for multi-period, multi-product and multi-resource production scheduling , 2003, J. Intell. Manuf..

[19]  Stephen G. Powell,et al.  Methods for assigning students to groups: a study of alternative objective functions , 2002, J. Oper. Res. Soc..

[20]  Jan Karel Lenstra,et al.  A local search template , 1998, Comput. Oper. Res..

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Joyendu Bhadury,et al.  Maximizing Workforce Diversity In Project Teams: A Network Flow Approach. , 2000 .

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

[24]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

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

[26]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

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

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

[29]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..