Assignments 2018 Undergraduate Student Class Schedule Builder The undergraduate
ID: 3756844 • Letter: A
Question
Assignments 2018 Undergraduate Student Class Schedule Builder The undergraduate students in the Bachelor of Computer Science program at Concordia Un versity select a schedule of course sections for each semester in order to fulfil the requirements of their program. Your job is to design a system to record their schedule, to check their schedule for consistency, and to guide them in building a schedule. Getting started: The assignments are organized so that you focus on different aspects of the information used by the system, and the different tasks of the system. Assignment One is about how to represent a weekly class schedule for the undergraduate student, as an object of class StudentClassSchedule Assignment Two is about checking a schedule for consistency with the requirements of the degree program (in terms of pre-requisites and co-requisites), checking that the student has done the required pre-requisites and satisfies the C-rule, and that there are no time conflicts between the selected sections for lectures, tutorials, and labs. Assignment Three is about developing heuristics to automatically build a schedule for an undergraduate student, or at least to guide a student in building their schedule Information: In general there is the following information available in the Concordia Un versity undergraduate calendar: > the requirements of the degree program (see below); the rules of the degree program (eg see the C-rule, below): »> a list of course descriptions, including pre-requisite and co-requisite requirments The general structure of an undergraduate degree in Computer Science is: the CS core consisting of 33 credits. the courses. COMP228, COMP232, C()MP233 COMP248, COMP249, COMP335, COMP346, COMP348, COMP352, COMP354; a complementary core of 6 credits consisting of the courses: ENCS282, ENCS393; Mathematics electives consisting of 6 credits, chosen from the courses: MAST218 MAST219, MAST234, MAST235, MAST332, MAST334, MATH251, MATH252, MATH339, MATH392 CS electives consisting of 30 credits, chosen from other COMP and SOEN courses: General electives consisting of 15 credits, chosen from outside of the ENCS Faculty, for example, from the Humanities, Social Sciences, Sciences, and Business. Note that some courses are 4 credit courses, or 3.5 credit courses, while most are 3 credit courses The C-rule requires a student to achieve a grade of C- or better in a 200-level course before they can use that course as a pre-requisite Each department in Conordia Universty w coordinate to offer a collection of course sections for a semesterExplanation / Answer
Schedule.java
package schedule;
import java.util.*;
import javax.swing.*;
import javax.swing.table.*;
import java.awt.*;
import java.awt.EventQueue;
import java.awt.event.*;
import java.awt.event.*;
import java.awt.geom.*;
import java.awt.Graphics2D;
import javax.swing.border.*;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
class coursedata
{
String name,code,department;
String[] stgrp,ins;
int credits,nostgrp,noins;;
char lab;
public coursedata()
{
name=new String();
code=new String();
department=new String();
stgrp=new String[100];
ins=new String[100];
nostgrp=0;
noins=0;
}
}
class stgrpdata
{
String info,code;
int strength;
String[] course;
public stgrpdata()
{
info=new String();
code=new String();
course=new String[100];
}
}
class insdata
{
String name,code;
String[] course;
public insdata()
{
name=new String();
code=new String();
course=new String[10];
}
}
class classdata
{
String department,code;
int strength;
public classdata()
{
department=new String();
code=new String();
}
}
class inputdata
{
coursedata[] course;
classdata[] rooms;
stgrpdata[] stgrp;
insdata[] ins;
int noroom,nocourse,nostgrp,noins;
public inputdata()
{
course=new coursedata[100];
rooms=new classdata[100];
stgrp=new stgrpdata[100];
ins=new insdata[100];
}
boolean classformat(String l)
{
StringTokenizer st=new StringTokenizer(l," ");
if(st.countTokens()==3)
return(true);
else
return(false);
}
public void takeinput()//takes input from file input.txt
{
try
{
File file = new File("input.txt");
Scanner scanner = new Scanner(file);
while (scanner.hasNextLine())
{
String line = scanner.nextLine();
//input courses
if(line.equals("courses"))
{
int i=0;
String arr;
while(!(line=scanner.nextLine()).equalsIgnoreCase("studentgroups"))
{
course[i]=new coursedata();
StringTokenizer st=new StringTokenizer(line," ");
course[i].name=st.nextToken();
course[i].code=st.nextToken();
course[i].credits=Integer.parseInt(st.nextToken());
course[i].department=st.nextToken();
course[i].lab=st.nextToken().charAt(0);
i++;
}
nocourse=i;
}
//input student groups
if(line.equalsIgnoreCase("studentgroups"))
{
int i=0,j,k;
String arr;
while(!(line=scanner.nextLine()).equalsIgnoreCase("instructors"))
{
stgrp[i]=new stgrpdata();
StringTokenizer st=new StringTokenizer(line," ");
stgrp[i].info=st.nextToken();
stgrp[i].code=st.nextToken();
stgrp[i].strength=Integer.parseInt(st.nextToken());
j=0;
while(st.hasMoreTokens())
{
stgrp[i].course[j++]=st.nextToken();
for(k=0;k<nocourse;k++)
{
if(course[k].code.equals(stgrp[i].course[j-1]))
{
course[k].stgrp[course[k].nostgrp++]=stgrp[i].code;
}
}
}
i++;
}
nostgrp=i;
}
//input instructors
if(line.equalsIgnoreCase("instructors"))
{
int i=0,j,k;
String arr;
while(!(line=scanner.nextLine()).equalsIgnoreCase("classrooms"))
{
ins[i]=new insdata();
StringTokenizer st=new StringTokenizer(line," ");
ins[i].name=st.nextToken();
ins[i].code=st.nextToken();
j=0;
while(st.hasMoreTokens())
{
ins[i].course[j++]=st.nextToken();
for(k=0;k<nocourse;k++)
{
if(course[k].code.equals(ins[i].course[j-1]))
{
course[k].ins[course[k].noins++]=ins[i].code;
}
}
}
i++;
}
noins=i;
}
//input classrooms
if(line.equalsIgnoreCase("classrooms"))
{
int i=0,j;
while(classformat(line=scanner.nextLine()))
{
rooms[i]=new classdata();
StringTokenizer st=new StringTokenizer(line," ");
rooms[i].code=st.nextToken();
rooms[i].department=st.nextToken();
rooms[i].strength=Integer.parseInt(st.nextToken());
i++;
}
noroom=i;
}
}
}
catch (Exception e) {
e.printStackTrace();
}
}
int returnclassno()
{
return(noroom);
}
int returninsno()
{
return(noins);
}
int returnstgrpno()
{
return(nostgrp);
}
int returncourseno()
{
return(nocourse);
}
}
//define gene
class gene
{
int[] g;
gene(int course,int stdgrp,int ins)
{
g=new int[Integer.toBinaryString(course).length()+Integer.toBinaryString(stdgrp).length()+Integer.toBinaryString(ins).length()];
}
}
//define chromosome
class chromosome
{
gene[] period;
chromosome(int rooms)
{
period=new gene[rooms*5*7];//no.of working days=5; no. working hours each day=7(8 to 12 and 1:30 to 4:30)
}
//determine fitness value of chromosome
double fitness(inputdata input,int norooms,int nocourse,int nostgrp,int noins)
{
int k,i,j,room=-1,flag;
double fitnessvalue=0,fit=0;
int lroom=Integer.toBinaryString(norooms).length();
int lcourse=Integer.toBinaryString(nocourse).length();
int lstgrp=Integer.toBinaryString(nostgrp).length();
int lins=Integer.toBinaryString(noins).length();
String course="",stgrp="",ins="",tempst="",tempin="",tempcs="";
int st,cs,in;
for(i=0;i<norooms*5*7;i++)
{
if(i%35==0)
room++;
//course for current gene
course="";
for(j=0;j<lcourse;j++)
course=course+period[i].g[j];
//stgrp for current gene
stgrp="";
for(j=lcourse;j<lcourse+lstgrp;j++)
stgrp=stgrp+period[i].g[j];
//ins for current gene;
ins="";
for(j=lcourse+lstgrp;j<lcourse+lstgrp+lins;j++)
ins=ins+period[i].g[j];
//integer value of stgrp
st=Integer.valueOf(stgrp,2);
//integer value of course
cs=Integer.valueOf(course,2);
//integer value of ins
in=Integer.valueOf(ins,2);
//check for the roomns and stgrp strength
if(input.rooms[room].strength>=input.stgrp[st].strength)
fit++;
//check for stgrp repeat
flag=1;
for(j=i+35;j<norooms*5*7;j+=35)
{
tempst="";
for(k=lcourse;k<lcourse+lstgrp;k++)
tempst=tempst+period[j].g[k];
if(tempst.equals(stgrp))
flag=0;
}
for(j=i-35;j>=0;j-=35)
{
tempst="";
for(k=lcourse;k<lcourse+lstgrp;k++)
tempst=tempst+period[j].g[k];
if(tempst.equals(stgrp))
flag=0;
}
if(flag==1)
fit++;
//check for ins repeat
flag=1;
for(j=i+35;j<norooms*5*7;j+=35)
{
tempin="";
for(k=lcourse+lstgrp;k<lcourse+lstgrp+lins;k++)
tempin=tempin+period[j].g[k];
if(tempin.equals(ins))
{
flag=0;
break;
}
}
for(j=i-35;j>=0;j-=35)
{
tempin="";
for(k=lcourse+lstgrp;k<lcourse+lstgrp+lins;k++)
tempin=tempin+period[j].g[k];
if(tempin.equals(ins))
{
flag=0;
break;
}
}
if(flag==1)
fit++;
//lab fitness checking
/*if(input.course[cs].lab=='y'||input.course[cs].lab=='Y')
{
if((i%7==0)||(i%7==1)||(i%7==4))
{
if(((input.course[cs+1].lab=='y')||(input.course[cs+1].lab=='Y'))&&((input.course[cs+2].lab=='y')||(input.course[cs+2].lab=='Y')))
}
}*/
}
//calculate fitness value
fitnessvalue=fit/(norooms*35);
return(fitnessvalue);
}
}
//timetable
class table
{
String course;
String ins;
String room;
table(){
course="";
ins="";
room="";
}
}
class timetable
{
private chromosome sol;
static table[][][] ttable;
inputdata input;
int nostgrp,noclass,noins,nocourse;
timetable(chromosome solution,int stgrp1,int nclass,int ins,int course,inputdata input1)
{
sol=solution;
nostgrp=stgrp1;
ttable=new table[nostgrp][7][5];
input=input1;
int i,j,k;
for(i=0;i<nostgrp;i++)
{
for(j=0;j<7;j++)
{
for(k=0;k<5;k++)
ttable[i][j][k]=new table();
}
}
noclass=nclass;
noins=ins;
nocourse=course;
}
void findtable()
{
double[] time={8.0,9.0,10.0,11.0,1.0,2.0,3.0};
int lcourse=Integer.toBinaryString(nocourse).length();
int lstgrp=Integer.toBinaryString(nostgrp).length();
int lins=Integer.toBinaryString(noins).length();
int lgene=lcourse+lstgrp+lins;
String[] day={"Mon","Tue","Wed","Thurs","Fri"};
int i,j,k,cs,st,in,room=-1,d=-1,t=0;
double x;
String course,stgrp,ins;
for(i=0;i<noclass*35;i++)
{
if(i%35==0)
{
room++;
d=-1;
//t=0;
}
if((i%7==0))
{
t=0;
d++;
}
//course for current gene
course="";
for(j=0;j<lcourse;j++)
course=course+sol.period[i].g[j];
//stgrp for current gene
stgrp="";
for(j=lcourse;j<lcourse+lstgrp;j++)
stgrp=stgrp+sol.period[i].g[j];
//ins for current gene;
ins="";
for(j=lcourse+lstgrp;j<lcourse+lstgrp+lins;j++)
ins=ins+sol.period[i].g[j];
//integer value of stgrp
st=Integer.valueOf(stgrp,2);
//integer value of course
cs=Integer.valueOf(course,2);
//integer value of ins
in=Integer.valueOf(ins,2);
ttable[st][t][d]=new table();
ttable[st][t][d].course=ttable[st][t][d].course+input.course[cs].code;
ttable[st][t][d].ins=ttable[st][t][d].ins+input.ins[in].code;
ttable[st][t][d].room=ttable[st][t][d].room+input.rooms[room].code;
t++;
}
for(i=0;i<nostgrp;i++)
{
for(j=0;j<7;j++)
{
for(k=0;k<5;k++)
if(ttable[i][j][k].course.equals(""))
{
ttable[i][j][k].course="--";
ttable[i][j][k].room="--";
ttable[i][j][k].ins="--";
}
}
}
System.out.println(" "+"Time table for given input of Courses:-");
for(i=0;i<nostgrp;i++)
{
System.out.println("===============================================================================================");
System.out.println("********************************** "+input.stgrp[i].code+" **************************************");
System.out.println("===============================================================================================");
System.out.print(" "+"TIME\DAY"+" ");
for(j=0;j<5;j++)
{
System.out.print(day[j]+" ");
}
System.out.println(" ");
for(j=0;j<7;j++)
{
x=time[j]+1;
if(j==1||j==2||j==3)
System.out.print(time[j]+"-"+x+" ");
else
System.out.print(time[j]+"-"+x+" ");
for(k=0;k<5;k++)
if(!ttable[i][j][k].course.equals(""))
System.out.print(ttable[i][j][k].course+" "+ttable[i][j][k].ins+" "+ttable[i][j][k].room+" ");
System.out.println(" ");
}
System.out.println(" ");
}
printtable print=new printtable(ttable,nostgrp,input);
print.print();
}
}
//main class
public class schedule {
static chromosome[] classes;
static int noclass,nocourse,noins,nostgrp;
static double[] fit;
static inputdata input;
static void createpopulation()
{
int i,j,k,l,le,c,q,s,in,m=0,n;
boolean flag;
noclass=input.returnclassno();//no of classrooms
nocourse=input.returncourseno();//no of courses
nostgrp=input.returnstgrpno();//no of stgrps
noins=input.returninsno();//no of ins
Random r=new Random();
classes=new chromosome[10000];
for(k=0;k<10000;k++)
{
classes[k]=new chromosome(noclass);
for(i=0;i<noclass*5*7;i++)
{
m=0;
l=Integer.toBinaryString(nocourse).length();
c=r.nextInt(nocourse);//course generation
classes[k].period[i]=new gene(nocourse,nostgrp,noins);
String x=Integer.toBinaryString(c);
le=x.length();
if(l>le)
{
for(j=0;j<l-le;j++)
classes[k].period[i].g[m++]=0;
}
for(j=0;j<le;j++)
{
classes[k].period[i].g[m++]=(x.charAt(j)-'0');
}
n=m;
//student group generation
flag=false;
while(!flag)
{
s=r.nextInt(nostgrp);
for(j=0;j<input.course[c].nostgrp;j++)
{
if(input.course[c].stgrp[j].equals(input.stgrp[s].code))
{
m=n;
l=Integer.toBinaryString(nostgrp).length();
x=Integer.toBinaryString(s);
le=x.length();
if(l>le)
{
for(j=0;j<l-le;j++)
classes[k].period[i].g[m++]=0;
}
for(j=0;j<le;j++)
{
classes[k].period[i].g[m++]=x.charAt(j)-'0';
}
flag=true;
break;
}
}
}
n=m;
//instructor generation
flag=false;
while(!flag)
{
in=r.nextInt(noins);
for(j=0;j<input.course[c].noins;j++)
{
if(input.course[c].ins[j].equals(input.ins[in].code))
{
m=n;
l=Integer.toBinaryString(noins).length();
x=Integer.toBinaryString(in);
le=x.length();
if(l>le)
{
for(j=0;j<l-le;j++)
classes[k].period[i].g[m++]=0;
}
for(j=0;j<le;j++)
{
classes[k].period[i].g[m++]=(x.charAt(j)-'0');
}
flag=true;
break;
}
}
}
//chromosome initialization finished
}
}
//chromosome initial population created
}
static void fitness(int size)
{
fit=new double[size];
int i;
for(i=0;i<size;i++)
{
fit[i]=classes[i].fitness(input,noclass,nocourse,nostgrp,noins);
}
}
static int branchandbound(int size)
{
int i,flag,l,j,k=0;
double small=fit[0],high=fit[0];
double[][] value=new double[1500][2];
for(i=1000;i>=8;i/=5)
{
k=0;
for(j=0;j<size;j++)
{
if((j%i==0)&&(j!=0))
{
value[k][0]=small;
value[k][1]=high;
small=fit[j];
high=fit[j];
k++;
continue;
}
if(small>fit[j])
small=fit[j];
if(high<fit[j])
high=fit[j];
}
for(j=0;j<k;j++)
{
flag=0;
for(l=0;l<k;l++)
{
if(l==j)
continue;
if(value[j][1]<value[l][0])
{
flag=1;
break;
}
}
if(flag==1)
{
for(l=(j*i);l<size-i;l++)
classes[l]=classes[l+i];
size=size-i;
}
}
}
return(size);
}
//parent selection for crossover
static int[] select(int size)
{
int[] select=new int[2];
int[] rwheel=new int[100000];
int i,j,k=0,percent;
double fitsum=0;
for(i=0;i<size;i++)
{
fitsum=fitsum+fit[i];
}
for(i=0;i<size;i++)
{
percent=(int)((((double)fit[i])/fitsum)*100000);
for(j=k;j<k+percent;j++)
rwheel[j]=i;
k=k+percent;
}
Random r=new Random();
//first parent
select[0]=rwheel[r.nextInt(100000)];
//second parent
select[1]=rwheel[r.nextInt(100000)];
return(select);
}
static void anomalyson(chromosome son1,int len_course,int len_stgrp,int len_ins,int row1)
{
String bin="";
boolean flag;
String x="";
int n,j,i;
for(i=0;i<len_course;i++)
bin=bin+son1.period[row1].g[i];
n=Integer.valueOf(bin,2);
Random r=new Random();
int c,s,in,m,le;
//check for invalid course code
if(n>=nocourse)
{
c=r.nextInt(nocourse);//course generation
x=Integer.toBinaryString(c);
le=x.length();
m=0;
if(len_course>le)
{
for(j=0;j<len_course-le;j++)
son1.period[row1].g[m++]=0;
}
for(j=0;j<le;j++)
{
son1.period[row1].g[m++]=(x.charAt(j)-'0');
}
//student group generation
flag=false;
while(!flag)
{
s=r.nextInt(nostgrp);
for(j=0;j<input.course[c].nostgrp;j++)
{
if(input.course[c].stgrp[j].equals(input.stgrp[s].code))
{
m=len_course;
x=Integer.toBinaryString(s);
le=x.length();
if(len_stgrp>le)
{
for(j=0;j<len_stgrp-le;j++)
son1.period[row1].g[m++]=0;
}
for(j=0;j<le;j++)
{
son1.period[row1].g[m++]=x.charAt(j)-'0';
}
flag=true;
break;
}
}
}
//instructor generation
flag=false;
while(!flag)
{
in=r.nextInt(noins);
for(j=0;j<input.course[c].noins;j++)
{
if(input.course[c].ins[j].equals(input.ins[in].code))
{
m=len_course+len_stgrp;
x=Integer.toBinaryString(in);
le=x.length();
if(len_ins>le)
{
for(j=0;j<len_ins-le;j++)
son1.period[row1].g[m++]=0;
}
for(j=0;j<le;j++)
{
son1.period[row1].g[m++]=(x.charAt(j)-'0');
}
flag=true;
break;
}
}
}
}
else
{
bin="";
for(i=len_course;i<len_course+len_stgrp;i++)
bin=bin+son1.period[row1].g[i];
c=n;
n=Integer.valueOf(bin,2);
//check for valid student group and if invalis generate a random student group for the course
if(n>=nostgrp)
{
flag=false;
while(!flag)
{
s=r.nextInt(nostgrp);
for(j=0;j<input.course[c].nostgrp;j++)
{
if(input.course[c].stgrp[j].equals(input.stgrp[s].code))
{
m=len_course;
x=Integer.toBinaryString(s);
le=x.length();
if(len_stgrp>le)
{
for(j=0;j<len_stgrp-le;j++)
{
son1.period[row1].g[m++]=0;
}
}
for(j=0;j<le;j++)
{
son1.period[row1].g[m++]=x.charAt(j)-'0';
}
flag=true;
break;
}
}
}
}
bin="";
for(i=len_course+len_stgrp;i<len_course+len_stgrp+len_ins;i++)
{
bin=bin+son1.period[row1].g[i];
}
n=Integer.valueOf(bin,2);
//check for valid instructor and if invalid generate a random ins code for the course
if(n>=noins)
{
flag=false;
while(!flag)
{
in=r.nextInt(noins);
for(j=0;j<input.course[c].noins;j++)
{
if(input.course[c].ins[j].equals(input.ins[in].code))
{
m=len_course+len_stgrp;
x=Integer.toBinaryString(in);
le=x.length();
if(len_ins>le)
{
for(j=0;j<len_ins-le;j++)
{
son1.period[row1].g[m++]=0;
}
}
for(j=0;j<le;j++)
{
son1.period[row1].g[m++]=(x.charAt(j)-'0');
}
flag=true;
break;
}
}
}
}
}
}
//single point crossover
static void crossover(int[] parent,chromosome son1,chromosome son2)
{
Random n1=new Random();
int k,r1,r2,row1,col1,row2,col2,i,j;
int len_course=Integer.toBinaryString(nocourse).length();
int len_stgrp=Integer.toBinaryString(nostgrp).length();
int len_ins=Integer.toBinaryString(noins).length();
int len_gene=len_course+len_stgrp+len_ins;
r1=n1.nextInt(len_gene*noclass*35);
r2=n1.nextInt((len_gene)*noclass*35);
row1=r1/(len_gene);
col1=r1%len_gene;
//single point crossover
for(i=0;i<row1;i++)
{
son1.period[i]=new gene(nocourse,nostgrp,noins);
son2.period[i]=new gene(nocourse,nostgrp,noins);
for(j=0;j<len_gene;j++)
{
son1.period[i].g[j]=classes[parent[1]].period[i].g[j];
son2.period[i].g[j]=classes[parent[0]].period[i].g[j];
}
}
for(j=0;j<col1;j++)
{
son1.period[row1]=new gene(nocourse,nostgrp,noins);
son2.period[row1]=new gene(nocourse,nostgrp,noins);
son1.period[row1].g[j]=classes[parent[1]].period[row1].g[j];
son2.period[row1].g[j]=classes[parent[0]].period[row1].g[j];
}
for(j=col1;j<len_gene;j++)
{
son1.period[row1]=new gene(nocourse,nostgrp,noins);
son2.period[row1]=new gene(nocourse,nostgrp,noins);
son1.period[row1].g[j]=classes[parent[0]].period[row1].g[j];
son2.period[row1].g[j]=classes[parent[1]].period[row1].g[j];
}
for(i=row1+1;i<noclass*35;i++)
{
son1.period[i]=new gene(nocourse,nostgrp,noins);
son2.period[i]=new gene(nocourse,nostgrp,noins);
for(j=0;j<len_gene;j++)
{
son1.period[i].g[j]=classes[parent[0]].period[i].g[j];
son2.period[i].g[j]=classes[parent[1]].period[i].g[j];
}
}
//check for anomalies
anomalyson(son1,len_course,len_stgrp,len_ins,row1);
anomalyson(son2,len_course,len_stgrp,len_ins,row1);
}
//mutation method
static void mutation(chromosome son)
{
int i;
int len_course=Integer.toBinaryString(nocourse).length();
int len_stgrp=Integer.toBinaryString(nostgrp).length();
int len_ins=Integer.toBinaryString(noins).length();
int len_gene=len_course+len_stgrp+len_ins;
for(i=0;i<noclass*35;i++)
{
Random r=new Random();
int pos=r.nextInt(len_gene*35*noclass);
int row=pos/len_gene;
int col=pos%len_gene;
if(son.period[row].g[col]==0)
son.period[row].g[col]=1;
if(son.period[row].g[col]==1)
son.period[row].g[col]=0;
anomalyson(son,len_course,len_stgrp,len_ins,row);
}
}
public static void main(String[] args)
{
int i=0,j,k=0,l;
chromosome temp;
double tempfit,maxfit=0;
chromosome[] newgen=new chromosome[10000];
chromosome[] sonparent=new chromosome[6]; //stores current parents,crossover sons and mutation sons
double[] fsonparent=new double[6]; //stores corresponding fitness values
double fit1,fit2,fitp1,fitp2;
int size=10000; //size of population
int[] parent=new int[2];
input=new inputdata();
input.takeinput();
chromosome maxchrome=new chromosome(noclass);
chromosome tempchrome=new chromosome(noclass);
//chromosome population creation/initialization
createpopulation();
int len_course=Integer.toBinaryString(nocourse).length();
int len_stgrp=Integer.toBinaryString(nostgrp).length();
int len_ins=Integer.toBinaryString(noins).length();
int len_gene=len_course+len_stgrp+len_ins;
//fitness initialization
fitness(size);
//for(l=0;l<3;l++){
//branch and bound to reduce the size and improve the quality of population set
size=branchandbound(size);
System.out.println(size);
//fitness calculation
fitness(size);
while(maxfit<2.1){
for(i=0;i<size/2;i++)
{
//parent selection for crossover operation
newgen[2*i]=new chromosome(noclass);
newgen[2*i+1]=new chromosome(noclass);
parent=select(size);
fitp1=fit[parent[0]];
fitp2=fit[parent[1]];
sonparent[0]=classes[parent[0]];
sonparent[1]=classes[parent[1]];
fsonparent[0]=fitp1;
fsonparent[1]=fitp2;
//crossover
chromosome son1=new chromosome(noclass);
chromosome son2=new chromosome(noclass);
crossover(parent,son1,son2);
fit1=son1.fitness(input,noclass,nocourse,nostgrp,noins);
fit2=son2.fitness(input,noclass,nocourse,nostgrp,noins);
sonparent[2]=son1;
sonparent[3]=son2;
fsonparent[2]=fit1;
fsonparent[3]=fit2;
mutation(son1);
mutation(son2);
fit1=son1.fitness(input,noclass,nocourse,nostgrp,noins);
fit2=son2.fitness(input,noclass,nocourse,nostgrp,noins);
sonparent[4]=son1;
sonparent[5]=son2;
fsonparent[4]=fit1;
fsonparent[5]=fit2;
//sort sonparent on basis of fsonparent
for(j=1;j<6;j++)
{
temp=sonparent[j];
tempfit=fsonparent[j];
for(k=j-1;k>=0;k--)
{
if(fsonparent[k]>tempfit)
{
sonparent[k+1]=sonparent[k];
fsonparent[k+1]=fsonparent[k];
}
else
break;
}
sonparent[k+1]=temp;
fsonparent[k+1]=tempfit;
}
newgen[2*i]=sonparent[5];
newgen[2*i+1]=sonparent[4];
}
for(i=0;i<size;i++)
{
classes[i]=newgen[i];
fit[i]=newgen[i].fitness(input,noclass,nocourse,nostgrp,noins);
}
tempfit=fit[0];
for(i=1;i<size;i++)
if(tempfit<fit[i])
{
tempfit=fit[i];
tempchrome=classes[i];
}
System.out.println("MAX ="+tempfit);
if(maxfit<tempfit)
{
maxfit=tempfit;
maxchrome=tempchrome;
}
//if(((maxfit<=3.0)&&(maxfit>=2.7))||(size<=1000))
// break;
System.out.println(maxfit);
}
System.out.println(maxfit);
timetable table1=new timetable(maxchrome,nostgrp,noclass,noins,nocourse,input);
table1.findtable();
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.