Solving university course timetabling problems using constriction particle swarm optimization with local search

DOI10.3390/a6020227zbMath1461.90176OpenAlexW2112311907MaRDI QIDQ1736554

Hsiao-Fang Shih, Ruey-Maw Chen

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6020227

zbMATH Keywords

particle swarm optimizationcourse timetablingconstriction factorinterchangesoft constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Genetic based discrete particle swarm optimization for elderly day care center timetabling

Cites Work

• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
• Tabu search for large scale timetabling problems
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
• A two-stage multiobjective scheduling model for [faculty-course-time assignments]
• Restricted coloring models for timetabling
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Solving the post enrolment course timetabling problem by ant colony optimization

This page was built for publication: Solving university course timetabling problems using constriction particle swarm optimization with local search