The metaheuristic genetic algorithm (GA) is based on the natural selection process that falls
under the umbrella category of evolutionary algorithms (EA). Genetic algorithms are typically …

This review discusses and analyses three main contributions championed by Professor
Mladenović. These include variable neighborhood search (VNS), variable formulation space …

Course timetabling is an ongoing challenge that universities face all around the world. This
combinatorial optimization task involves allocating a set of events into finite time slots and …

Grou** problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

This paper proposes a novel competition-guided multi-neighborhood local search (CMLS)
algorithm for solving the curriculum-based course timetabling problem. In comparison with …

Abstract The Multi-Depot Vehicle Routing Problem (MDVRP) is a variant of the Vehicle
Routing Problem (VRP) that consists in designing a set of vehicle routes to serve all …

Academic institutions may be edging towards a global uncertainty, recession, and a string of
financial difficulties. An effective course timetabling is one of managerial strategies to …

The timetabling problem, a well-known NP-Hard optimization challenge, spans multiple
domains such as education, healthcare, sports, and transportation. Due to its computational …

Timetabling is a managerial problem that recurringly appears in various domains such as
education, transport, sports, and staff management. The combinatorial nature of this problem …

Timetabling problem at universities is one of the problems that require more attention in
operations research. This problem is known as NP-Hard problem, therefore non …