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

DOI10.3390/A6020227zbMATH Open1461.90176OpenAlexW2112311907MaRDI QIDQ1736554FDOQ1736554

Authors: Ruey-Maw Chen, Hsiao-Fang Shih 

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

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

Recommendations

• A harmony search algorithm for university course timetabling
• Metaheuristics for university course timetabling
• University course timetabling problem using a heuristic approach based on uniform teaching resources
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem

zbMATH Keywords

particle swarm optimizationcourse timetablingconstriction factorinterchangesoft constraint

Mathematics Subject Classification ID

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

Cites Work

• Tabu search for large scale timetabling problems
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Solving the post enrolment course timetabling problem by ant colony optimization
• A two-stage multiobjective scheduling model for [faculty-course-time] assignments
• Restricted coloring models for timetabling
• 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
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem

Cited In (3)

• Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Genetic based discrete particle swarm optimization for elderly day care center timetabling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736554)