A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem

Table 1

2∗n length binary encoding scheme.

No.	2∗n length binary vector	Meaning
1	00	No item of the group is chosen
2	01	The first item of the group is chosen
3	10	The second item of the group is chosen
4	11	The third item of the group is chosen