Sun Xuecheng

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper presents a hybrid genetic algorithm to solve the make-up examination arrangement problem. The objective of make-up examination arrangement to minimize the number of classrooms is analyzed, and a greedy algorithm and an original mutation operator are devised to achieve this goal. This new operator, combined with a crossover and a local search(More)
  • 1