Improved Swarm Intelligence Algorithms For Timetabling Problem Solving
Improved Swarm Intelligence Algorithms For Timetabling Problem Solving
Timetable
Generate
Events
Swarm
Intelligence
Dataset
Algorithm
Generate
Time
Slots
General Proposal
The UCTP which is an NP-hard problem is a type of scheduling problem, The
goal of the UCTP is to find a method to allocate whole events to fix predefined
time slots and rooms, where all constraints within the problem must be
satisfied.