Genetic based discrete particle swarm optimization for elderly day care center timetabling
type: Item
instance of: scholarly article
title: Genetic based discrete particle swarm optimization for elderly day care center timetabling
zbMATH Open document ID: 1349.90374
published in: Computers \& Operations Research
publication date: 2016-11-17T00:00:00Z
full work available at URL: https://strathprints.strath.ac.uk/54185/
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 6654070
zbMATH Keywords: timetabling problem
zbMATH Keywords: discrete particle swarm optimization
zbMATH Keywords: weighted MAX-constraint satisfaction problem
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithm
zbMATH Keywords: MIN-conflict random walk
zbMATH Keywords: maximum constraint satisfaction problem
zbMATH Keywords: min-conflict random-walk algorithm
zbMATH Keywords: NP-hardnon-deterministic polynomial hard
MaRDI profile type: Publication
OpenAlex ID: W1435381774
cites work: A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
cites work: A variable neighborhood search based matheuristic for nurse rostering problems
cites work: New approaches to nurse rostering benchmark instances
cites work: A two-phase adaptive variable neighborhood approach for nurse rostering
cites work: Nominal and robust train timetabling problems
cites work: Solving university course timetabling problems using constriction particle swarm optimization with local search
cites work: Hybrid bee colony optimization for examination timetabling problems
cites work: A branch and bound algorithm for numerical Max-CSP
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
cites work: An improved particle swarm optimization algorithm for flowshop scheduling problem
cites work: A survey of school timetabling research
cites work: A survey of search methodologies and automated system development for examination timetabling
cites work: Sports scheduling: Problems and applications
cites work: Integer programming methods for large-scale practical classroom assignment problems
cites work: A constraint programming based column generation approach to nurse rostering problems
cites work: Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
DOI: 10.1016/J.COR.2015.07.010
author: M. Y. Lin
author: Kwai-Sang Chin
author: Kwok-Leung Tsui
author: T. C. Wong
description: scientific article; zbMATH DE number 6654070