Multiple constraint satisfaction problems using the A-star (A*) search algorithm: classroom scheduling with preferences

Authors:
Kian L. Pokorny;Ryan E. Vincent
Affiliations:
McKendree University, Lebanon, IL;McKendree University, Lebanon, IL
Venue:
Journal of Computing Sciences in Colleges
Year:
2013

Citing 3
Cited 0

Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences

Expert Systems with Applications: An International Journal
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the use of the A-star (A*) search algorithm to solve a constraint satisfaction problem. Specifically, we present the use of A* in solving an extended version of the classroom scheduling problem which assigns courses to rooms with constraints of times and instructor availability. We implement a program which uses the A* algorithm to create a schedule; assigning courses to rooms with the added constraints of the instructors' preferences and requirements for the room attributes, and a time frame of a given course. Happiness levels are used and the system attempts to maximize the overall happiness of each course and thus the overall happiness of the entire schedule. To provide a comparable frame of reference for the results, we implement simulated annealing (SA) and genetic algorithms (GA) for the same problem. Finally, empirical results of several simulations are presented.