Genetic based discrete particle swarm optimization for Elderly Day Care Center timetabling

Abstract

The timetabling problem of local Elderly Day Care Centers (EDCCs) is formulated into a weighted maximum constraint satisfaction problem (Max-CSP) in this study. The EDCC timetabling problem is a multi-dimensional assignment problem, where users (elderly) are required to perform activities that require different venues and timeslots, depending on operational… (More)
DOI: 10.1016/j.cor.2015.07.010

16 Figures and Tables

Topics

  • Presentations referencing similar topics