S. Krootjohn

  • Citations Per Year
Learn More
University Course Timetabling Problem (UCTP) is an NP-hard problem, and has many factors to be considered. The Genetic Algorithm (GA) is one of the most popular methods used in UCTP. It is best suited and widely used for NP-hard and optimization problems. Selection, crossover, and mutation are key operators which can influence the GA's performance.(More)
  • 1