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

Table 2

3∗n length binary encoding scheme.

No.	3∗n length binary vector	Meaning
1	000	No item of the group is chosen
2	001	The first item of the group is chosen
3	010	The second item of the group is chosen
4	011	Violate constraint (2)
5	100	The third item of the group is chosen
6	101	Violate constraint (2)
7	110	Violate constraint (2)
8	111	Violate constraint (2)