The application of Coarse-Grained Parallel Genetic Algorithm with Hadoop in University Intelligent Course-Timetabling System

Liping Wu


The university course-timetabling problem is a NP-C problem. The traditional method of arranging course is inefficient, causes a high conflict rate of teacher resource or classroom resource, and is poor satisfaction in students. So it does not meet the requirements of modern university educational administration management. However, parallel genetic algorithm (PGA) not only have the advantages of the traditional genetic algorithm(GA), but also take full advantage of the computing power of parallel computing. It can improve the quality and speed of solving effectively, and have a broad application prospect in solving the problem of university course-timetabling problem. In this paper, based on the cloud computing platform of Hadoop, an improved method of fusing coarse-grained parallel genetic algorithm (CGPGA) and Map/Reduce programming model is deeply researched, and which is used to solve the problem of university intelligent courses arrangement. The simulation experiment results show that, compared with the traditional genetic algorithm, the coarse-grained parallel genetic algorithm not only improves the efficiency of the course arrangement and the success rate of the course, but also reduces the conflict rate of the course. At the same time, this research makes full use of the high parallelism of Map/Reduce to improve the efficiency of the algorithm, and also solves the problem of university scheduling problem more effectively.


Intelligent algorithm; Coarse-grained parallel genetic algorithm (CGPGA); Intelligent course-timetabling system; Map Reduce

Full Text:


Copyright (c) 2017 Liping Wu

International Journal of Emerging Technologies in Learning (iJET) – eISSN: 1863-0383
Creative Commons License
Scopus logo Clarivate Analyatics ESCI logo EI Compendex logo IET Inspec logo DOAJ logo DBLP logo Learntechlib logo EBSCO logo Ulrich's logo Google Scholar logo MAS logo