Design of automated Course Scheduling system based on hybrid genetic algorithm

Author(s):  
Yong OuYang ◽  
Yi Chen
2013 ◽  
Vol 760-762 ◽  
pp. 1782-1785
Author(s):  
Xiu Ying Li ◽  
Dong Ju Du

A reasonable curriculum contributes to the improvement of the training and teaching quality of college students. Using computer which is speed and strong ability to arrange curriculum automatically is imperative. Automatically curriculum arrangement is a constrained, multi-objective and intricate combinatorial optimization problem. Based on genetic algorithm of population search, it is suitable to process complex and nonlinear optimization problems which it difficult to solve for traditional search methods. In this paper solves complex automated course scheduling using genetic algorithms.


2020 ◽  
Vol 9 (3) ◽  
pp. 201-212
Author(s):  
Fani Puspitasari ◽  
Parwadi Moengin

The problem of university course scheduling is a complicated job to do because of the many constraints that must be considered, such as the number of courses, the number of rooms available, the number of students, lecturer preferences, and time slots. The more courses that will be scheduled, the scheduling problem becomes more complex to solve. Therefore, it is necessary to set an automatic course schedule based on optimization method. The aim of this research is to gain an optimal solution in the form of schedule in order to decrease the number of clashed courses, optimize room utilization and consider the preferences of lecturer-course. In this research, a hybridization method of Genetic Algorithm (GA) and Pattern Search (PS) is investigated for solving university course scheduling problems. The main algorithm is GA to find the global optimum solution, while the PS algorithm is used to find the local optimum solution that is difficult to obtain by the GA method. The simulation results with 93 courses show that the Hybrid GA-PS method works better than does the GA method without hybrid, as evidenced by the better fitness value of the hybrid GA-PS method which is -3528.62 and 99.24% of the solutions achieved. While the GA method without hybrid is only able to reach a solution of around 65% and has an average fitness value of -3100.76.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chun-jiang Shuai

In order to overcome the problems of convergence and low satisfaction in the traditional course scheduling system, a new Electronic Engineering Teaching Automatic Course Scheduling System based on the Monte Carlo genetic algorithm is proposed in this paper. The overall structure and hardware structure of the course scheduling system are designed. The hardware includes system management, course scheduling information input, course scheduling management, and course schedule query. In the software part, the Monte Carlo genetic algorithm is used to optimize the course scheduling optimization process, and a course scheduling scheme more in line with the needs of students and teachers is obtained. The experimental results show that the Monte Carlo genetic algorithm has higher convergence and higher user satisfaction compared with the traditional genetic algorithm. Therefore, it shows that the performance of the course scheduling system has been effectively improved.


Sign in / Sign up

Export Citation Format

Share Document