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

Computers and Operations Research

Volumn 65, Issue , 2016, Pages 125-138

  Lin, M Y ^a   Chin, K S ^a   Tsui, K L ^a   Wong, T C ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Discrete particle swarm optimization; Genetic algorithm; Min conflict random walk; Tabu search; Timetabling problem; Weighted max constraint satisfaction problem

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; CONSTRAINT THEORY; ELEMENTARY PARTICLE SOURCES; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); RANDOM PROCESSES; SCHEDULING; TABU SEARCH;

BRANCH AND BOUND TECHNIQUES; DISCRETE PARTICLE SWARM OPTIMIZATION; GUIDED GENETIC ALGORITHMS; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS; MULTIDIMENSIONAL ASSIGNMENT; OPERATIONAL CONSTRAINTS; RANDOM WALK; TIMETABLING PROBLEM;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84939124282     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2015.07.010     Document Type: Article

References (46)

1. K. Christensen, G. Doblhammer, R. Rau, and J.W. Vaupel Ageing populations: the challenges ahead The Lancet 374 9696 2009 1196 1208
2. U.E. Reinhardt Does the aging of the population really drive the demand for health care Health Aff 22 6 2003 27 39
3. I.P. Solos, I.X. Tassopoulos, and G.N. Beligiannis A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem Algorithms 6 2 2013 278 308
4. F. Della Croce, and F. Salassa A variable neighborhood search based matheuristic for nurse rostering problems Ann Oper Res 218 1 2014 185 199
5. H.G. Santos, T.A.M. Toffolo, R.A.M. Gomes, and S. Ribas Integer programming techniques for the nurse rostering problem Ann Oper Res 2014 1 27
6. E.K. Burke, and T. Curtois New approaches to nurse rostering benchmark instances Eur J Oper Res 237 1 2014 71 81
7. I.X. Tassopoulos, I.P. Solos, and G.N. Beligiannis Α two-phase adaptive variable neighborhood approach for nurse rostering Comput Oper Res 60 2015 150 169
8. V. Cacchiani, and P. Toth Nominal and robust train timetabling problems Eur J Oper Res 219 3 2012 727 737
9. S.N. Jat, and S.X. Yang A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling J Sched 14 6 2011 617 637
10. D.F. Shiau A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences Expert Syst Appl 38 1 2011 235 248
11. Jat SN. Yang Sx Genetic algorithms with guided and local search strategies for university course timetabling IEEE Trans Syst Man Cybern Part C: Appl Rev 41 1 2011 93 106
12. S. Ceschia, L. Di Gaspero, and A. Schaerf Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem Comput Oper Res 39 7 2012 1615 1624
13. I.X. Tassopoulos, and G.N. Beligiannis A hybrid particle swarm optimization based algorithm for high school timetabling problems Appl Soft Comput 12 11 2012 3472 3489
14. R.M. Chen, and H.F. Shih Solving university course timetabling problems using constriction particle swarm optimization with local search Algorithms 6 2 2013 227 244
15. M. Alzaqebah, and S. Abdullah Hybrid bee colony optimization for examination timetabling problems Comput Oper Res 54 0 2015 142 154
16. E.C. Freuder, and R.J. Wallace Partial constraint satisfaction Artif Intell 58 1 1992 21 70
17. J.M. Normand, A. Goldsztejn, M. Christie, and F. Benhamou A branch and bound algorithm for numerical Max-CSP Constraints 15 2 2010 213 237
18. S. Minton, M.D. Johnston, A.B. Philips, and P. Laird Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems Artif Intell 58 1 1992 161 205
19. P. Galinier, and J.K. Hao Tabu search for maximal constraint satisfaction problems G. Smolka, 1997 Springer 196 208
20. S. Bouamama, B. Jlifi, and K. Ghédira D2G2A: a distributed double guided genetic algorithm for Max-CSPs V. Palade, R.J. Howlett, L. Jain, 2003 Springer 422 429
21. A. Khadhraoui, and S. Bouamama A new hybrid distributed double guided genetic swarm algorithm for optimization and constraint reasoning: case of Max-CSPs Int J Swarm Intell Res 3 2 2012 63 74
22. C.T. Tseng, and C.J. Liao A discrete particle swarm optimization for lot-streaming flowshop scheduling problem Eur J Oper Res 191 2 2008 360 373
23. C.S. Zhang, J.G. Sun, X.J. Zhu, and Q.Y. Yang An improved particle swarm optimization algorithm for flowshop scheduling problem Inf Process Lett 108 4 2008 204 209
24. Ponnambalam SG, Jawahar N, Chandrasekaran S. Discrete particle swarm optimization algorithm for flowshop scheduling. In: Lazinica A, (Ed.). In: Proceedings of the particle swarm optimization. INTECH Open Access Publisher; 2009.
25. X.P. Wang, and L.X. Tang A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking Appl Soft Comput 12 2 2012 652 662
26. X.Y. Shao, W.Q. Liu, Q. Liu, and C.Y. Zhang Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem Int J Adv Manuf Technol 2013 1 17
27. F.P. Goksal, I. Karaoglan, and F. Altiparmak A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery Comput Ind Eng 2012
28. P.N. Kechagiopoulos, and G.N. Beligiannis Solving the urban transit routing problem using a particle swarm optimization based algorithm Appl Soft Comput 21 2014 654 676
29. T.K. Ho, C.W. Tsang, K.H. Ip, and K.S. Kwan Train service timetabling in railway open markets by particle swarm optimisation Expert Syst Appl 39 1 2012 861 868
30. Bratton D, Kennedy J. Defining a standard for particle swarm optimization. In: Proceedings of the 4th swarm intelligence symposium (SIS'07). Honolulu, Hawaii, USA: IEEE; 2007. p. 120-7.
31. E.K. Burke, and J. Kingston Applications to timetabling J.L. Gross, J. Yellen, 2004 CRC Press 445
32. N. Pillay A survey of school timetabling research Ann Oper Res 218 1 2014 261 293
33. S.A. MirHassani, and F. Habibi Solution approaches to the course timetabling problem Artif Intell Rev 39 2 2013 133 149
34. R. Qu, E.K. Burke, B. McCollum, L.T.G. Merlot, and S.Y. Lee A survey of search methodologies and automated system development for examination timetabling J Sched 12 1 2009 55 89
35. C.C. Ribeiro Sports scheduling: problems and applications Int Trans Oper Res 19 1-2 2012 201 226
36. V. Cacchiani, A. Caprara, and P. Toth Scheduling extra freight trains on railway networks Transp Res Part B: Methodol 44 2 2010 215 231
37. C. Liebchen, and R. Möhring The modeling power of the periodic event scheduling problem: railway timetables-and beyond F. Geraets, L. Kroon, A. Schoebel, D. Wagner, C. Zaroliagis, 2007 Springer Berlin, Heidelberg 3 40
38. A.E. Phillips, H. Waterer, M. Ehrgott, and D.M. Ryan Integer programming methods for large-scale practical classroom assignment problems Comput Oper Res 53 2015 42 53
39. F. He, and R. Qu A constraint programming based column generation approach to nurse rostering problems Comput Oper Res 39 12 2012 3331 3343
40. Eberhart R, Kennedy J. A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science (MHS' 95). Nagoya, Japan: IEEE; 1995. p. 39-43.
41. C. Akjiratikarl, P. Yenradee, and P.R. Drake An improved particle swarm optimization algorithm for care worker scheduling Ind Eng Manag Syst 7 2 2008 171 181
42. B. Liu, L. Wang, and Y.H. Jin An effective PSO-based memetic algorithm for flow shop scheduling IEEE Trans Syst Man Cybern Part B: Cybern 37 1 2007 18 27
43. H. Zhang, X.D. Li, H. Li, and F.L. Huang Particle swarm optimization-based schemes for resource-constrained project scheduling Autom Constr 14 3 2005 393 404
44. P. Jonsson, A. Krokhin, and F. Kuivinen Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems V. Diekert, M. Volkov, A. Voronkov, 2007 Springer Berlin, Heidelberg 182 193
45. Sharapov RR. Genetic algorithms: basic ideas, variants and analysis. In: Obinata G, Dutta A, (Eds.). Vision systems: segmentation and pattern recognition. INTECH Open Access Publisher; 2007.
46. D.C. Montgomery Design and analysis of experiments 1984 Wiley New York