Genetic algorithms vs. greedy algorithms in the optimization of course scheduling

  • Authors:
  • Christopher Herbig

  • Affiliations:
  • St. Edward's University

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic algorithms are a recent addition to the computing paradigm and with their arrival, comes the idea that they may be able to replace currently used methods. This is an experiment to determine if genetic algorithms can produce a course schedule and if the algorithm compares to a greedy algorithm in response time.