• DocumentCode
    3432104
  • Title

    Design of automated Course Scheduling system based on hybrid genetic algorithm

  • Author

    Yong Ouyang ; Yi Chen

  • Author_Institution
    Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan, China
  • fYear
    2011
  • fDate
    3-5 Aug. 2011
  • Firstpage
    256
  • Lastpage
    259
  • Abstract
    Course Scheduling problem is a constrained, multi-objective optimization problem, and has proven to be a NP complete problem, usually resolved by genetic algorithm, but the effect is not satisfactory, the paper presents a genetic algorithm-based, combined with tabu search and the coloring principle to automatically arrange more complete global search using genetic algorithms, tabu search using local optimization, convergence speed and avoid local optimization, the better solution for all hard soft conditions constraints and satisfactory solution by the users.
  • Keywords
    convergence; educational courses; genetic algorithms; scheduling; search problems; NP complete problem; automated course scheduling system design; coloring principle; complete global search; hybrid genetic algorithm; multiobjective optimization problem; tabu search; Biological cells; Educational institutions; Encoding; Genetic algorithms; Manuals; Optimization; Search problems; Course Scheduling problem; genetic algorithm; tabu search;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science & Education (ICCSE), 2011 6th International Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-9717-1
  • Type

    conf

  • DOI
    10.1109/ICCSE.2011.6028629
  • Filename
    6028629