Genetic Algorithm to Solve the Problem Arranging Course

DOI

10.2991/mmebc-16.2016.213How to use a DOI?

Keywords

Genetic Algorithm,graph theory,Genetic Algorithm

Abstract

With the continuous development of higher education, reasonable distribution of teaching resources has become an urgent problem in time and space. This question is a typical college course arrangement.Arranging Course problem is NP-complete a multiple target multi portfolio. We use an improved hybrid genetic algorithm to analyze in depth Timetable optimization problem. Genetic algorithm based on a certain probability based on the size of individual fitness of populations survival of the fittest selection, simulated annealing algorithm is able to accept a certain probability of a temporary degradation phenomenon, which has a certain ability to jump out of local optima were a wider range of search. So we simulated annealing algorithm into genetic algorithm, both to ensure the formation of a hybrid algorithm has the speed of evolution to ensure the quality of the essence in order to get the best method of arranging.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chengyang Li
PY  - 2016/06
DA  - 2016/06
TI  - Genetic Algorithm to Solve the Problem Arranging Course
BT  - Proceedings of the 2016 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer
PB  - Atlantis Press
SP  - 1022
EP  - 1025
SN  - 2352-5401
UR  - https://doi.org/10.2991/mmebc-16.2016.213
DO  - 10.2991/mmebc-16.2016.213
ID  - Li2016/06
ER  -