Genetic based discrete particle swarm optimization for Elderly Day Care Center timetabling
Proposed GDPSO combines min-conflict strategy, random walk and genetic operators. Proposed GDPSO outperforms in stability and efficiency than MCRW, TS, GGA, and SPSO. Proposed GDPSO has a faster and consistent rate of convergence. Proposed GDPSO results in superior performance to solve complex timetabling problem.
discrete particle swarm optimization timetabling problem weighted max-constraint satisfaction problem tabu search genetic algorithm min-conflict random walk