Since university timetabling is commonly classified as a combinatorial optimisation problem,
researchers tend to use optimisation approaches to reach the optimal timetable solution …

In this paper, we propose a particle swarm optimization (PSO) based hyper-heuristic
algorithm for solving the resource constrained project scheduling problem (RCPSP). To the …

The timetabling problems is the most prominent problem in combinatorial optimization.
University Examination Timetabling Problem (UETP) is considered as one of the common …

Distributed shop scheduling problems (DSSPs) have attracted increasing interest in recent
years due to the technical trends of smart manufacturing and Industry 4.0. The distributed …

In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural
optimization problems is presented. The structure proposed to be optimized here is a simply …

Local search algorithms have been successfully used for many combinatorial optimisation
problems. The choice of the most suitable local search algorithm is, however, a challenging …

The current study investigates the Intelligent Water Drops (IWD) metaheuristic algorithm to
construct and produce good quality solutions for the university examination timetabling …

The problem of scheduling final exams is a type of educational planning in which the goal is
to find a suitable schedule for the exams of an educational institution in a way that makes …

Abstract The field of Search-Based Software Engineering (SBSE) has widely utilized Multi-
Objective Evolutionary Algorithms (MOEAs) to solve complex software engineering …

Exam timetabling is a prominent topic in academic administration management as it ensures
the effective utilization of resources and satisfies the requirements and preferences of …