A study of evoluntionary perturbative hyper-heuristics for the nurse rostering problem.
| dc.contributor.advisor | Pillay, Nelishia. | |
| dc.contributor.author | Rae, Christopher Stephen William Exter. | |
| dc.date.accessioned | 2018-02-26T11:37:20Z | |
| dc.date.available | 2018-02-26T11:37:20Z | |
| dc.date.created | 2017 | |
| dc.date.issued | 2017 | |
| dc.description | Master of Science in Computer Science. University of KwaZulu-Natal, Pietermaritzburg 2017. | en_US |
| dc.description.abstract | Hyper-heuristics are an emerging field of study for combinatorial optimization. The aim of a hyper-heuristic is to produce good results across a set of problems rather than producing the best results. There has been little investigation of hyper-heuristics for the nurse rostering problem. The majority of hyper-heuristics for the nurse rostering problem fit into a single type of hyper-heuristic, the selection perturbative hyper-heuristic. There is no work in using evolutionary algorithms employed as selection perturbative hyper-heuristics for the nurse rostering problem. There is also no work in using the generative perturbative type of hyper-heuristic for the nurse rostering problem. The first objective of this dissertation is to investigate the selection perturbative hyper-heuristic for the nurse rostering problem and the effectiveness of employing an evolutionary algorithm (SPHH). The second objective is to investigate a generative perturbative hyper-heuristic to evolve perturbation heuristics for the nurse rostering problem using genetic programming (GPHH). The third objective is to compare the performance of SPHH and GPHH. SPHH and GPHH were evaluated using the INRC2010 benchmark data set and the results obtained were compared to available results from literature. The INRC2010 benchmark set is comprised of sprint, medium and long instance types. SPHH and GPHH produced good results for the INRC2010 benchmark data set. GPHH and SPHH were found to have different strengths and weaknesses. SPHH found better results than GPHH for the medium instances. GPHH found better results than SPHH for the long instances. SPHH produced better average results. GPHH produced results that were closer to the best known results. These results suggest future research should investigate combining SPHH and GPHH to benefit from the strengths of both perturbative hyper-heuristics. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10413/15057 | |
| dc.language.iso | en_ZA | en_US |
| dc.subject | Theses - Computer Science. | en_US |
| dc.subject.other | Hyper - Heuristics. | en_US |
| dc.subject.other | Nurse Rostering. | en_US |
| dc.subject.other | Evolutionary Algorithms. | en_US |
| dc.subject.other | Genetic programming. | en_US |
| dc.subject.other | Combinatorial optimization. | en_US |
| dc.title | A study of evoluntionary perturbative hyper-heuristics for the nurse rostering problem. | en_US |
| dc.type | Thesis | en_US |