Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search

Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search

Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and o...

Full description

Bibliographic Details
Main Authors: Hsiao-Fang Shih, Ruey-Maw Chen
Format: Article
Language:English
Published: MDPI AG 2013-04-01
Series:Algorithms
Subjects:
course timetabling
soft constraint
particle swarm optimization
constriction factor
interchange
Online Access:http://www.mdpi.com/1999-4893/6/2/227

Internet

http://www.mdpi.com/1999-4893/6/2/227

Similar Items