1. A PARALLEL GENETIC ALGORITHM FOR SOLVING THE SCHOOL TIME TABLING PROBLEM SUMALATHA

2. WHAT IS SCHOOL TIMETABLING? SCHEDULING TEACHERS, ROOMS AND CLASSES INTO A FIXED NUMBER OF PERIODS SUCH THAT NO TEACHER OR CLASS OR ROOM APPEARS MORE THAN ONCE IN A PERIOD(NO CLASHES). A PARTICULAR COMBINATION OF A TEACHER, CLASS AND ROOM IS CALLED AS A TUPLE.

3. EACH PERIOD IS SCHEDULED WITH SOME TUPLES SUCH THAT THERE ARE NO CLASHES. EFFICIENCY OF A TIMETABLE IS ESTIMATED BY COUNTING THE NUMBER OF CLASHES IN EACH PERIOD. LESSER THE COUNT GREATER THE EFFICIENCY WHAT IS SCHOOL TIME TABLING? CONT..

4. PERIOD: TUPLE 1TUPLE 5TUPLE 4TUPLE 9TUPLE 10TUPLE 7 TIME TABLE: PERIOD 1TUPLE 4TUPLE 5TUPLE 8TUPLE 1TUPLE 12 PERIOD 2TUPLE 10TUPLE 5TUPLE 9TUPLE 11TUPLE 6 | PERIOD NTUPLE 3TUPLE 6TUPLE 9TUPLE 15TUPLE 1

5. WHY GENETIC ALGORITHMS? GENETIC ALGORITHMS ARE USED TO GENERATE A BETTER SET OF SOLUTIONS (NEW POPULATION) FROM A GIVEN SET OF SOLUTIONS (OLD POPULATION) BY USING CROSSOVER AND MUTATION. IF THE NEWLY FORMED CHILD SUITS THE ENVIRONMENT, THEN THE PROBABILITY THAT THE CHILD SURVIVES INCREASES. AVERAGE FITNESS OF THE POPULATION INCREASES WITH EACH GENERATION.

6. APPLICATION OF GA TO TIME TABLING PROBLEM EACH PERIOD REPRESENTS A CHROMOSOME. EACH TUPLE REPRESENTS A GENE. SELECTION OF PARENTS: RANDOM SELECTION METHOD IS USED TO SELECT PARENTS(TIME TABLES) FROM THE POPULATION. CROSSOVER OR MATING: CROSS OVER IS DONE BETWEEN THE CORRESPONDING PERIODS OF THE TIMETABLE. RANDOM CROSSOVER METHOD IS USED.

7. MUTATION: RANDOM MUTATION METHOD IS USED. HERE, MUTATION IS CHANGING THE PERIOD OF A TUPLE. A TUPLE IS SELECTED RANDOMLY FROM A PERIOD AND MOVED TO A RANDOMLY SELECTED PERIOD. CROSSOVER AND MUTATION ARE APPLIED TO THE OLD POPULATION FOR A FIXED NUMBER OF GENERATIONS OR TILL NO PERFECT INDIVIDUAL IS LEFT.

8. PARALLEL IMPLEMENTATION: MATING IS HIGHLY CONCURRENT, i.e. CROSSOVER IS INDEPENDENT OF REST OF THE POPULATION. THIS SECTION IS IMPLEMENTED IN PARALLEL USING SHARED MEMORY MULTIPROCESSORS. NUMBER OF GENERATIONS AND SIZE OF THE POPULATION(NO OF CHILDREN TO BE GENERATED) ARE ASSUMED BEFOREHAND.

9. CREATION OF CHILDREN IS DISTRIBUTED AMONG THE PARALLEL PROCESSORS. EACH PROCESSOR IS RESPONSIBLE FOR A FIXED NUMBER OF CHILDREN. CARE IS TAKEN THAT NO TWO PROCESSORS WILL GENERATE SAME CHILD.

10. ALGORITHM: while number of generations < limit & no perfect individual { for each child in the population { choose two living parents at random from old population create an empty child for each period of the parents { mate corresponding periods

11. Copy new child period to corresponding position in child } Apply mutation to randomly selected period and tuple Measure fitness of the child if fitness < minimum allowed fitness then Set child status to born dead else Set child status to living end if } OLD POPULATION = NEW POPULATION }

12. CONCLUSION: WHILE USING THE OLD POPULATION: TWO PROCESSORS MAY ACCESS SAME PARENT. CRITICAL REGIONS ARE NOT REQUIRED BECAUSE PARENTS ARE USED IN READ ONLY MODE. WHILE CREATING THE NEW POPULATION: CRITICAL REGIONS ARE NOT REQUIRED IN CHILD CREATION BECAUSE EACH CHILD IS CREATED BY ONLY ONE PROCESSOR. BARRIER LEVEL SYNCHRONISATION IS REQUIRED AT THE END OF EACH GENERATION.

13. PERFORMANCE OF SEQUENTIAL GA DATATUPLESCLASESSTEACHERSROOMSFINAL COST GENERA TIONS 110015 07 215015 031 320015 0102 425015 0198 530015 0445 6903330307 712044404098

14. SPEEDUP OF TESTS ON DATASET 7 DAT A TUPLE S POPUL ATION 1 PROC 2 PROCS 3 PROCS 4 PROCS PEAK SPEED UP 7 120 7523761971089.3/10 PROC S 712020018869214312059.2/10 PROC S