Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_center" colspan="2">Hard constraints</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">HC1</td><td class="align_left">All demanded shifts assigned to a nurse.</td></tr><tr><td class="align_left">HC2</td><td class="align_left">A nurse can work with only a single shift per day.</td></tr><tr><td class="align_left">HC3</td><td class="align_left">The minimum number of nurses required for the shift.</td></tr><tr><td class="align_left">HC4</td><td class="align_left">The total number of working days for the nurse should be between the maximum and minimum range.</td></tr><tr><td class="align_left">HC5</td><td class="align_left">A day shift followed by night shift is not allowed.</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Computational Intelligence and Neuroscience

tab1

Table 1

Table 1: Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem 