Of Course Arrangement System Based On Immune Clone Algorithm Research And Design

Schedule-arranging problem is the routine of the management in the college, which is a very difficult task for the educational administration. In the past years, the manual operation is often adopted. In order to determine a suitable schedule to satisfy the multiple constraints, one should check and revise the schedule again and again. With the constantly development of high education, course arranging problem has very important role in training students and rising the education quality. Along with the increasing number of students the course arranging is becoming a particularly hard and key teaching supervisory work.Up to now there is not an accredited and efficient way for the schedule-arranging problem. The most difficult problem is the modeling of the multiple constraints, such as the constraint for the room, the class of the constraint, and so on. Therefore the arrangement is very difficult to satisfy these multiple constraints. Schedule-arranging is a very complicated schedule problem. It is also a NP-Complete (Non-deterministic Polynomial Time) problem. So far, the NP-Complete is a function is a kind of exponential function which is best way to solve multiple restrictions, including the restrictions of teachers, students, teaching facility and course time. All the restrictions try to be satisfied in order to get the optimum.In this paper we designed and realized an automatic course arranging system based on the immune clone selection algorithm, in order to solve the NP-hard problem. Firstly we deduced the multiple constraints of the problem, and designed the clone operator and selection operator to speed up the fundamental immune clone algorithm. Then we use JSP as the development tool, and realized the system with the platform Windows XP. When the system is applied in practical, the results show its efficiency and feasibility.