Computational Intelligence and Neuroscience

Research Article

Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem

Pseudocode of Modified Nelder-Mead Method.

Modified Nelder-Mead Method for directed honey bee food search
() Initialization:
denotes the list of vertices in simplex, where .
, , and are the coefficients of reflection, expansion, contraction and shrinkage.
is the objective function to be minimized.
() Ordering:
Order the vertices in simplex from lowest objective function value ) to highest value ). Ordered as
.
() Midpoint:
Calculate the midpoint for first two best vertices in simplex , where .
() Reflection Process:
Calculate reflection point by, .
if then
and Go to to Step ().
end if
() Expansion Process:
if ) then
Calculate expansion point using,
end if
if ) then
and Go to to Step ().
else
and Go to to Step ().
end if
() Contraction Process:
if then
Compute outside contraction by, .
end if
if ) then
Compute inside contraction by, .
end if
if ) then
Contraction is done between and the best vertex among and .
end if
if ) then
and Go to to Step ().
else goes to Step ().
end if
if ) then
and Go to to Step ().
else Go to to Step ().
end if
() Shrinkage Process:
Shrink towards the best solution with new vertices by, , where .
() Stopping Criteria:
Order and re-label new vertices of the simplex based on their objective function and go to step ().