Variants and Parameters Investigations of Particle Swarm Optimisation for Solving Course Timetabling Problems
University course timetabling problem (UCTP) is well known to be Non-deterministic Polynomial (NP)-hard problem, in which the amount of computational time required to find the optimal solutions increases exponentially with problem size. Solving the UCTP manually with/without course timetabling tool...
Saved in:
Published in | Advances in Swarm Intelligence Vol. 11655; pp. 177 - 187 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2019
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!