Bee Colony Optimization Algorithm for Nurse Rostering

2013 ◽  
Vol 43 (2) ◽  
pp. 467-473 ◽  
Author(s):  
Nikola Todorovic ◽  
Sanja Petrovic
Keyword(s):  
Optimization Algorithm ◽  
Nurse Rostering ◽  
Bee Colony ◽  
Bee Colony Optimization

scholarly journals Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem

2017 ◽  
Vol 2017 ◽  
pp. 1-26 ◽  
Author(s):  
M. Rajeswari ◽  
J. Amudhavel ◽  
Sujatha Pothula ◽  
P. Dhavachelvan
Keyword(s):  
Optimization Algorithm ◽  
Programming Model ◽  
Particle System ◽  
Nurse Rostering ◽  
Scheduling Problems ◽  
Bee Colony ◽  
Nurse Rostering Problem ◽  
Bee Colony Optimization ◽  
Hard And Soft Constraints ◽  
Multiobjective Mathematical Programming

The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead Method for solving the NRP. To solve the NRP, the authors used a multiobjective mathematical programming model and proposed a methodology for the adaptation of a Multiobjective Directed Bee Colony Optimization (MODBCO). MODBCO is used successfully for solving the multiobjective problem of optimizing the scheduling problems. This MODBCO is an integration of deterministic local search, multiagent particle system environment, and honey bee decision-making process. The performance of the algorithm is assessed using the standard dataset INRC2010, and it reflects many real-world cases which vary in size and complexity. The experimental analysis uses statistical tools to show the uniqueness of the algorithm on assessment criteria.

Sign in / Sign up

Export Citation Format

Share Document