Dichotomous Binary Differential Evolution for Knapsack Problems

Algorithm 1

Ratio-greedy repair.

Input: Infeasible individual ; Weights of each item ; Capacity of a knapsack

  () while   is infeasible  do

  ()   = ratio-greedily select an item from the knapsack;

  ()  ;

  ()  if    then

  ()   Return ;

  ()  end if

  () end while

Output: Feasible individual