Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Practical genetic algorithms
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
A Genetic Algorithm for the Set Partitioning Problem
Proceedings of the 5th International Conference on Genetic Algorithms
An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Genetic Algorithms and Highly Constrained Problems: The Time-Table Case
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
A Genetic Algorithm Solving a Weekly Course-Timetabling Problem
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Use of Rules and Preferences for Schedule Builders in Genetic Algorithms for Production Scheduling
Selected Papers from AISB Workshop on Evolutionary Computing
Hi-index | 0.00 |
Genetic algorithms can be applied with great success on a wide range of problems, including scheduling problems. This paper presents an application of genetic algorithms to a complex scheduling problem, wherein student demand for courses and scheduling constraints inform the production of a course schedule. The scheduler is currently in use in a decision support system at the U.S. Army War College, and has produced excellent results for two academic years. The problem domain and software solution are described, and the representations and algorithms used by the scheduler are presented. Empirical observations about the scheduler's performance and problem-solving characteristics are also presented.