The thesis defense grouping is a common problem in the college management. To ensure the fairness and scientificity, it is necessary to consider some constraints between supervisors and students when grouping. There are two inherent contradictions:the principles of mutual avoidance and uniformity. In this paper, the main issue is to find out an optimal solution that satisfies the two conditions as far as it is possible. Through the establishment of mathematical model, the respondent grouping problem is summarized as the matrix encoding. Then two conflict conditions are consolidated into one objective function. The single objective differential evolution with superior-inferior crossover scheme is adopted to solve this problem. A suitable chromosome representation and fitness function are designed. A series of operations such as mutation, superior-inferior crossover and modification are performed. The optimal solution is obtained when the evolution is terminated. To test the advantages of this method, a general algorithm is designed for comparison with it. The results show that the grouping solution obtained by differential evolution using a superior-inferior crossover scheme is more scientific and feasible than the general algorithm.