Solving University Scheduling Problem with a Memetic Algorithm

@inproceedings{Abbaszadeh2012SolvingUS,
  title={Solving University Scheduling Problem with a Memetic Algorithm},
  author={Mortaza Abbaszadeh and Saeed Saeedvand and Hamid Asbagi Mayani},
  year={2012}
}
Received May 31, 2012 Revised Jun 8, 2012 Accepted Jun 15, 2012 Scheduling problem is one of the Non-deterministic Polynomial (NP) problems. This means that using a normal algorithm to solve NP problems is so time-consuming a process (it may take months or even years with available equipment), and thus such an algorithm is regarded as an impracticable way of dealing with NP problems. The m thod of Memetic Algorithm presented in this paper is different from other available algorithms. In this… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

School Timetabling Problem : The Greek Case 1265 – 1280 . [ 13 ] EnzheYa And Ki SeokSung , " Trans in Op

G. Beligiannisa, C. Moschopoulosa, G. Kaperonisa, D. Likothanassisa
A Genetic Algorithm based University Timetabling System , Proceedings of the - 40 " A Genetic Algorithm for the Teacher Assignment Problem for a University - 16 , 2008 . " A Guided Search Genetic Algorithm for the university Course Timetabling " University Course timetabling with Genetic , 2008 . A • 2002