Diploid code genetic algorithm used to solve UTP
基于双倍体遗传算法求解大学排课问题

The University Timetable Problem (UTP) is a typical NP-hard problem. Using the layered method, the common combined programming model of five dimensions was decompounded into two three-dimensional combinations, cutting down the problem scale. Then in view of the disadvantages of the traditional genetic algorithm for UTP, the diploid code was put forward and alternate evolution was used to optimize multi-targets one by one. Experimental results show that the method realizes the pattern theorem and quickens the evolving velocity.