Ghaith M. Jaradat

Learn More
The University Course Timetabling is a complex optimization Problem which is difficult to solve for optimality. It involves assigning lectures to a fixed number of timeslots and rooms; while satisfying some constraints. The goal is to construct a feasible timetable and satisfy soft constraints as much as possible. In this study, we apply two hybrids Ant(More)
Ant System algorithms are nature-inspired population-based metaheuristics derived from the field of swarm intelligence. Seemingly, the ant system has a lack of search diversity control since it has only a global pheromone update that intensifies the search. Hence, one or more assistant mechanisms are required to strengthen the search of the ant system.(More)
In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big(More)
Scatter Search (SS) is an evolutionary population-based metaheuristic that has been successfully applied to hard combinatorial optimization problems. In contrast to the genetic algorithm, it reduces the population of solutions size into a promising set of solutions in terms of quality and diversity to maintain a balance between diversification and(More)
There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms.(More)
This work investigates the performance of a hybrid population-based meta-heuristic with an external memory structure of a hybrid elitist-ant system (elitist-AS). This memory is known as an elite pool, which contains high quality and diverse solutions to maintain a balance between diversity and quality of the search. This may guarantee the effectiveness and(More)
This study presents an investigation of enhancing the capability of the Scatter Search (SS) metaheuristic in guiding the search effectively toward elite solutions. Generally, SS generates a population of random initial solutions and systematically selects a set of diverse and elite solutions as a reference set for guiding the search. The work focuses on(More)
The requirement of employability in the job market prompted universities to conduct internship training as part of their study plans. There is a need to train students on important academic and professional skills related to the workplace with an IT component. This article describes a statistical study that measures satisfaction levels among students in the(More)
In this study, the performance of Scatter Search (SS) meta-heuristic for the post-enrolment course timetabling problems reported in recent literature was reviewed. The aim is to address the strengths and limitations of the SS structure and mechanisms; to empower more studies; to investigate the capabilities of SS; and to enhance it for solving timetabling(More)
  • 1