Large-scale timetabling problems with adaptive tabu search
Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable and soft constraints that must meet as many as possible during forming a...
Main Authors: | Awad Fouad H., Al-kubaisi Ali, Mahmood Maha |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2022-01-01
|
Series: | Journal of Intelligent Systems |
Subjects: | |
Online Access: | https://doi.org/10.1515/jisys-2022-0003 |
Similar Items
-
Meta-heuristic approaches for the University Course Timetabling Problem
by: Sina Abdipoor, et al.
Published: (2023-09-01) -
A New Meta-Heuristics Data Clustering Algorithm Based on Tabu Search and Adaptive Search Memory
by: Youseef Alotaibi
Published: (2022-03-01) -
Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems
by: Yuji Koguma
Published: (2024-01-01) -
Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling
by: Gabriella Icasia, et al.
Published: (2020-08-01) -
Two-phase tabu search algorithm for solving Chinese high school timetabling problems under the new college entrance examination reform
by: Zhe Sun, et al.
Published: (2023-03-01)