Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3

Yi Xie
Yi Xie
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

The course-schedule problem is a multi-objective optimization problem, the global near-optimal solution couldn't be obtained by only using the direct heuristic algorithm, and the constringency would be slow by only using the standard genetic algorithm. So a hybrid genetic algorithm (abbreviated to HGA) which combined the direct heuristic algorithm with the standard genetic algorithm is put forward. By using a new simple intuitive two-dimensional space-time array encoding and a new block crossover operator, HGA only have little course-unit conflicts after crossing and mutating, and the conflict is easy to digest. The experiments show that the global near-optimal solution can be obtained quickly by using HGA.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal