Using Nested Tables and Multi-pitch Adjusting in Harmony Search (NTMHS) to solve timetabling problem in object-relational model

Abstract

In this paper, we conduct our novel approach called NTMHS that employs nested tables and multi-pitch adjusting in harmony search algorithm to solve timetabling problem in database object-relational model. Our approach examines the ability of object-relational model to provide structural storage, indexed and organized processing for query. In NTMHS, timetables are produced depending on structure of nested tables that effectively deal with multi-pitch adjusting within the algorithm of harmony search. NTMHS approach has been implemented and applied to a proposed model for semester-based course timetables of Computing and Information Technology Faculty at the University of Science and Technology. Results show that NTMHS idea led to overcome hard and soft constraints of timetabling process in an effective way, short time, and the absence of conflicts.