Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem

<table class="table-group" id="tab5"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">Type</td><td class="align_center">Method</td><td class="align_center">Reference</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left"><span style="width: 16.6725ptpx;"><svg height="11.5695pt" id="M347" style="vertical-align:-3.18152pt" version="1.1" viewbox="-0.0498162 -8.38798 16.6725 11.5695" width="16.6725pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M861 0V28C774 35 771 41 768 147L759 509C756 612 762 614 851 622V650H681L449 149L221 650H57V622C148 613 153 609 144 479L130 271C123 166 117 123 111 88C104 46 85 34 26 28V0H259V28C192 35 169 42 167 90C166 130 166 173 170 256L185 541H187L411 7H431L675 555H679L683 147C683 41 680 35 598 28V0H861Z" id="g121-75"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="891" vert-adv-y="891"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,11.583,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg></span></td><td class="align_center">Artificial Bee Colony Algorithm</td><td class="align_center">[<a href="/journals/cin/2017/6563498/#B27">14</a>]</td></tr><tr><td class="align_left"><span style="width: 16.6725ptpx;"><svg height="11.5695pt" id="M348" style="vertical-align:-3.18152pt" version="1.1" viewbox="-0.0498162 -8.38798 16.6725 11.5695" width="16.6725pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M861 0V28C774 35 771 41 768 147L759 509C756 612 762 614 851 622V650H681L449 149L221 650H57V622C148 613 153 609 144 479L130 271C123 166 117 123 111 88C104 46 85 34 26 28V0H259V28C192 35 169 42 167 90C166 130 166 173 170 256L185 541H187L411 7H431L675 555H679L683 147C683 41 680 35 598 28V0H861Z" id="g121-75"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="891" vert-adv-y="891"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,11.583,3.132)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z" id="g50-51"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg></span></td><td class="align_center">Hybrid Artificial Bee Colony Algorithm</td><td class="align_center">[<a href="/journals/cin/2017/6563498/#B28">15</a>]</td></tr><tr><td class="align_left"><span style="width: 16.6725ptpx;"><svg height="11.6791pt" id="M349" style="vertical-align:-3.29112pt" version="1.1" viewbox="-0.0498162 -8.38798 16.6725 11.6791" width="16.6725pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M861 0V28C774 35 771 41 768 147L759 509C756 612 762 614 851 622V650H681L449 149L221 650H57V622C148 613 153 609 144 479L130 271C123 166 117 123 111 88C104 46 85 34 26 28V0H259V28C192 35 169 42 167 90C166 130 166 173 170 256L185 541H187L411 7H431L675 555H679L683 147C683 41 680 35 598 28V0H861Z" id="g121-75"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="891" vert-adv-y="891"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,11.583,3.132)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z" id="g50-52"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg></span></td><td class="align_center">Global best harmony search</td><td class="align_center">[<a href="/journals/cin/2017/6563498/#B29">16</a>]</td></tr><tr><td class="align_left"><span style="width: 16.6725ptpx;"><svg height="11.5695pt" id="M350" style="vertical-align:-3.18152pt" version="1.1" viewbox="-0.0498162 -8.38798 16.6725 11.5695" width="16.6725pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M861 0V28C774 35 771 41 768 147L759 509C756 612 762 614 851 622V650H681L449 149L221 650H57V622C148 613 153 609 144 479L130 271C123 166 117 123 111 88C104 46 85 34 26 28V0H259V28C192 35 169 42 167 90C166 130 166 173 170 256L185 541H187L411 7H431L675 555H679L683 147C683 41 680 35 598 28V0H861Z" id="g121-75"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="891" vert-adv-y="891"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,11.583,3.132)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z" id="g50-53"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg></span></td><td class="align_center">Harmony Search with Hill Climbing</td><td class="align_center">[<a href="/journals/cin/2017/6563498/#B30">17</a>]</td></tr><tr><td class="align_left"><span style="width: 16.6725ptpx;"><svg height="11.6791pt" id="M351" style="vertical-align:-3.29112pt" version="1.1" viewbox="-0.0498162 -8.38798 16.6725 11.6791" width="16.6725pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M861 0V28C774 35 771 41 768 147L759 509C756 612 762 614 851 622V650H681L449 149L221 650H57V622C148 613 153 609 144 479L130 271C123 166 117 123 111 88C104 46 85 34 26 28V0H259V28C192 35 169 42 167 90C166 130 166 173 170 256L185 541H187L411 7H431L675 555H679L683 147C683 41 680 35 598 28V0H861Z" id="g121-75"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="891" vert-adv-y="891"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,11.583,3.132)"><path d="M158 548H390L417 615L410 623H122L83 318C105 326 143 337 185 337C296 337 350 275 350 188C350 116 308 42 225 42C164 42 122 74 100 93C90 101 82 99 72 92C60 82 51 68 50 59C48 46 52 38 66 24C82 9 125 -12 172 -12C225 -11 292 15 346 59C408 108 437 166 437 226C437 309 371 397 242 397C214 397 170 382 133 369L158 548Z" id="g50-54"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg></span></td><td class="align_center">Integer Programming Technique for NRP</td><td class="align_center">[<a href="/journals/cin/2017/6563498/#B31">18</a>]</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Computational Intelligence and Neuroscience

tab5

Table 5

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