SIAM Journal on Computing
A Memetic Approach to the Nurse Rostering Problem
Applied Intelligence
An Electromagnetism-like Mechanism for Global Optimization
Journal of Global Optimization
The Assignment Problem with Seniority and Job Priority Constraints
Operations Research
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
An indirect genetic algorithm for a nurse-scheduling problem
Computers and Operations Research
Variable neighborhood search for nurse rostering problems
Metaheuristics
The State of the Art of Nurse Rostering
Journal of Scheduling
On the Convergence of a Population-Based Global Optimization Algorithm
Journal of Global Optimization
A multi criteria meta-heuristic approach to nurse rostering
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The electromagnetism meta-heuristic applied to the resource-constrained project scheduling problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems
Expert Systems with Applications: An International Journal
DEM: a discrete electromagnetism-like mechanism for solving discrete problems
CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
An evolutionary approach for the nurse rerostering problem
Computers and Operations Research
A hybrid metaheuristic approach to the university course timetabling problem
Journal of Heuristics
Hybrid swarm-based optimization algorithm of GA & VNS for nurse scheduling problem
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Nurse rostering using modified harmony search algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
A harmony search algorithm for nurse rostering problems
Information Sciences: an International Journal
An artificial immune system based approach for solving the nurse re-rostering problem
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Computers and Industrial Engineering
Hi-index | 0.00 |
In this paper, we present a novel meta-heuristic technique for the nurse scheduling problem (NSP). This well-known scheduling problem assigns nurses to shifts per day maximizing the overall quality of the roster while taking various constraints into account. The problem is known to be NP-hard.Due to its complexity and relevance, many algorithms have been developed to solve practical and often case-specific models of the NSP. The huge variety of constraints and the several objective function possibilities have led to exact and meta-heuristic procedures in various guises, and hence comparison and state-of-the-art reporting of standard results seem to be a utopian idea.We present a meta-heuristic procedure for the NSP based on the framework proposed by Birbil and Fang (J. Glob. Opt. 25, 263---282, 2003). The Electromagnetic (EM) approach is based on the theory of physics, and simulates attraction and repulsion of sample points in order to move towards a promising solution. Moreover, we present computational experiments on a standard benchmark dataset, and solve problem instances under different assumptions. We show that the proposed procedure performs consistently well under many different circumstances, and hence, can be considered as robust against case-specific constraints.