Curriculum Schedule Arrangement Solved by an Improved Immune Optimization Algorithm

Article Preview

Abstract:

To solve the university timetabling problem (UTP) effectively, a immune algorithm-based solution for UTP was proposed. The mathematical model of UTP was expounded, a framework of immune algorithm was given, and simulation experiments were done to validate algorithm. Experimental result shows that proposed algorithm can solve the UTP effectively, and has the advantage of good application value.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

3556-3561

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Tan yong, wang ling. Course timetabling system based on genetic algorithm. computer application, PP. 108-111, (2002).

Google Scholar

[2] Tengzi, Denghuiwen. Based on the genetic algorithm in the course scheduling system design and Implementation. computer application, PP. 199-203, (2007).

Google Scholar

[3] Pengfuming, wuzhijian. Based on multi-population genetic algorithm in course scheduling method . Computer engineering and design, PP. 4877-4881, (2010).

Google Scholar

[4] Zhanghuawei, yangkai, Particle swarm optimization algorithm based on the research of course scheduling . Journal of Zhengzhou University of Light Industry, PP. 49-52, (2010).

Google Scholar

[5] Wu xia, Jiangyuming. The use of immune particle swarm optimization algorithm to solve scheduling problem. Computer engineering and design, PP. 4877-4881, (2010).

Google Scholar

[6] N. Pillay, W. Banzhaf.An informed genetic algorithm for the examination timetabling problem. Applied Soft Computing, PP. 457-467, (2011).

DOI: 10.1016/j.asoc.2009.08.011

Google Scholar