Tung Khac Truong

Binary BAT algorithm with greedy repair for the discounted 0-1 knapsack problem

The discounted 0-1 knapsack problem (D0-1KP) generalizes the classical knapsack problem by partitioning items into groups of three, in which the third item of every group represents a discounted bundle of the first two and at most one item per group may be loaded. This grouping constraint enlarges the search space and...