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...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Swarm Intelligence Vol. 11655; pp. 177 - 187
Main Authors Thepphakorn, Thatchai, Pongcharoen, Pupong
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2019
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…