TY - JOUR
T1 - A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems
AU - Abdel-Basset, Mohamed
AU - El-Shahat, Doaa
AU - Faris, Hossam
AU - Mirjalili, Seyedali
PY - 2019/6/1
Y1 - 2019/6/1
N2 - This work proposes a new Modified Multi-Verse Optimization (MMVO) algorithm for solving the 0-1 knapsack (0-1 KP) and multidimensional knapsack problems (MKP). MMVO incorporates a two-step repair strategy for handling constraints. In addition, a barrier function is employed for assigning negative values to the infeasible solutions so that their fitness cannot outperform the fitness of the feasible ones. MMVO avoids local optima by re-initializing the population every predetermined number of iterations while keeping the best solution obtained so far. For discretizing the solutions, MMVO employs a V-shaped transfer function (tanh). The research applies the proposed method to several knapsack case studies and demonstrates its application in resource allocation of Adaptive Multimedia Systems (AMS). The results show the benefits of the MMVO algorithm in solving binary test and real-world problems.
AB - This work proposes a new Modified Multi-Verse Optimization (MMVO) algorithm for solving the 0-1 knapsack (0-1 KP) and multidimensional knapsack problems (MKP). MMVO incorporates a two-step repair strategy for handling constraints. In addition, a barrier function is employed for assigning negative values to the infeasible solutions so that their fitness cannot outperform the fitness of the feasible ones. MMVO avoids local optima by re-initializing the population every predetermined number of iterations while keeping the best solution obtained so far. For discretizing the solutions, MMVO employs a V-shaped transfer function (tanh). The research applies the proposed method to several knapsack case studies and demonstrates its application in resource allocation of Adaptive Multimedia Systems (AMS). The results show the benefits of the MMVO algorithm in solving binary test and real-world problems.
KW - Knapsack problem
KW - Meta-heuristic
KW - Multi-verse optimizer
KW - Multidimensional knapsack optimization
UR - http://www.scopus.com/inward/record.url?scp=85067938994&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2019.04.025
DO - 10.1016/j.cie.2019.04.025
M3 - Article
AN - SCOPUS:85067938994
SN - 0360-8352
VL - 132
SP - 187
EP - 206
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
ER -
