Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem

The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack. Therefore, the DKP is more complicated and computa...

Full description

Bibliographic Details
Main Authors: Yan-Hong Feng, Gai-Ge Wang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8302509/