Hybrid Elitist-Ant System for Nurse-Rostering Problem

Abstract The diversity and quality of high-quality and diverse-solution external memory of the hybrid Elitist-Ant System is examined in this study. The Elitist-Ant System incorporates an external memory for preserving search diversity while exploiting the solution space. Using this procedure, the effectiveness and efficiency of the search may be guaranteed which could consequently improve the performance of the algorithm and it could be well generalized across diverse problems of combinatorial optimization. The generality of this algorithm through its consistency and efficiency is tested using a Nurse-Rostering Problem. The outcomes demonstrate the competitiveness of the hybrid Elitist-Ant System’s performance within numerous datasets as opposed to those by other systems. The effectiveness of the external memory usage in search diversification is evidenced in this work. Subsequently, such usage improves the performance of the hybrid Elitist-Ant System over diverse datasets and problems.

[1]  Edmund K. Burke,et al.  New approaches to nurse rostering benchmark instances , 2014, Eur. J. Oper. Res..

[2]  George Goulas,et al.  A systematic two phase approach for the nurse rostering problem , 2012, Eur. J. Oper. Res..

[3]  Mutasem K. Alsmadi,et al.  An efficient similarity measure for content based image retrieval using memetic algorithm , 2017 .

[4]  Khairuddin Omar,et al.  A hybrid memetic algorithm with back-propagation classifier for fish classification based on robust features extraction from PLGF and shape measurements , 2011 .

[5]  Mutasem K. Alsmadi,et al.  Query-sensitive similarity measure for content-based image retrieval using meta-heuristic algorithm , 2017, J. King Saud Univ. Comput. Inf. Sci..

[6]  Jin-Kao Hao,et al.  Adaptive neighborhood search for nurse rostering , 2012, Eur. J. Oper. Res..

[7]  John J. Bartholdi,et al.  A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..

[8]  Harvey H. Millar,et al.  Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming , 1998 .

[9]  Masri Ayob,et al.  The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems , 2016, Appl. Soft Comput..

[10]  J. Amudhavel,et al.  Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem , 2017, Comput. Intell. Neurosci..

[11]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

[12]  Patrick De Causmaecker,et al.  A categorisation of nurse rostering problems , 2011, J. Sched..

[13]  M. Alsmadi,et al.  A GENERAL FISH CLASSIFICATION METHODOLOGY USING META-HEURISTIC ALGORITHM WITH BACK PROPAGATION CLASSIFIER , 2014 .

[14]  Khairuddin Omar,et al.  Fish Classification: Fish Classification Using Memetic Algorithms with Back Propagation Classifier , 2012 .

[15]  Peter Brucker,et al.  Personnel scheduling: Models and complexity , 2011, Eur. J. Oper. Res..

[16]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[17]  Mutasem Alsmadi,et al.  Facial recognition under expression variations , 2016, Int. Arab J. Inf. Technol..

[18]  Túlio A. M. Toffolo,et al.  Integer programming techniques for the nurse rostering problem , 2014, Annals of Operations Research.

[19]  Murad A. Rassam,et al.  Deluge Harmony Search Algorithm For Nurse Rostering Problems , 2019, 2019 First International Conference of Intelligent Computing and Engineering (ICOICE).