By Topic

Algorithms of time table problem application and performance evaluation in course scheduling system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yunfeng Dong ; Comput. Center, Shandong Polytech. Univ., Jinan, China ; Bei Qi ; Wushi Gao ; Qingzhu Wang
more authors

This paper analyzes the nature of university curriculum problems (Time table Problem TTP), as well as the strengths and weaknesses of the problem solving, and evaluate some time table problem's arithmetic performance. The basic algorithm including greedy algorithm, simulated annealing algorithm, genetic algorithm and the improved genetic search algorithm by author. This thesis discover the use of genetic algorithms to solve the problem of arrangement, it has precocious phenomenon and quickly converge the local optimum rather than global optimal solution, so we combine the local search method with partial matching crossover operation, genetic algorithm combined with tabu search to solve the problem. We have carried on the massive experiments to prove it, and analysis and evaluation the performance of the improved algorithm. Experimental results show that genetic search algorithm is a better algorithm for TTP.

Published in:

Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on

Date of Conference:

8-10 Aug. 2011