+91 9538798040
Bookmark and Share
 





HEURISTIC AND MULTI-AGENT SOLUTIONS OF A UNIVERSITY TIMETABLING PROBLEM FOR HIGHER EDUCATION INSTITUTIONS


FERNANDO S*. VIRAY JR.
Page No. 1-12


Abstract

Higher Education Institutions (HEIs) both locally and abroad are continuously faced with the difficult challenges of preparing university class schedules every semester, thus, making the University Timetabling Problem (UTP) considered as one of the most tedious recurring problems in higher education. The challenges of the UTP coupled with varying institutional policies, constraints, government regulations, and never-ending Higher Educations Orders (CMOs) and other variables needs to be addressed. This research focuses on the design and implementation of a heuristic multi-agent university timetabling solutions by employing local search and optimization algorithms, Tabu Search, Greedy Algorithm, Integer Linear Programming, and Bi-Partite Graph approach of Artificial Intelligence. Simulation results in one of the five campuses with random faculty member projected schedule using actual tertiary level scheduling data have shown that the system yielded feasible and optimum schedule solutions. The study was conducted among 2,000 students and 200 faculty members. The implementation of achievable artificial intelligent and multi-agent-based system in all the campuses has the possibility of gaining tremendous benefits such as less time and conflict-free schedule.
Keywords : local optimization solutions, greedy algorithm, university timetabling problem, multi-agent system, tabu search, and divide-and-conquer


Download complete article in pdf format