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

DOI10.1016/J.COR.2015.07.010zbMATH Open1349.90374OpenAlexW1435381774MaRDI QIDQ342133FDOQ342133

Authors M. Y. Lin, Kwai-Sang Chin, Kwok-Leung Tsui, T. C. Wong

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://strathprints.strath.ac.uk/54185/

zbMATH Keywords

genetic algorithmtabu searchdiscrete particle swarm optimizationmaximum constraint satisfaction problemMIN-conflict random walkmin-conflict random-walk algorithmNP-hardnon-deterministic polynomial hardtimetabling problemweighted MAX-constraint satisfaction problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• scientific article; zbMATH DE number 1866918
• Solving university course timetabling problems using constriction particle swarm optimization with local search
• Solving the timetable problem with multiple constraints using genetic algorithms
• Applying evolutionary computation to the school timetabling problem: The Greek case
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.

Cites work

• A branch and bound algorithm for numerical Max-CSP
• A constraint programming based column generation approach to nurse rostering problems
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
• A survey of school timetabling research
• A survey of search methodologies and automated system development for examination timetabling
• A two-phase adaptive variable neighborhood approach for nurse rostering
• A variable neighborhood search based matheuristic for nurse rostering problems
• An improved particle swarm optimization algorithm for flowshop scheduling problem
• Hybrid bee colony optimization for examination timetabling problems
• Integer programming methods for large-scale practical classroom assignment problems
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• New approaches to nurse rostering benchmark instances
• Nominal and robust train timetabling problems
• Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
• Solving university course timetabling problems using constriction particle swarm optimization with local search
• Sports scheduling: problems and applications

This page was built for publication: Genetic based discrete particle swarm optimization for elderly day care center timetabling

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