A Weight-coded Evolutionary Algorithm for the Multidimensional Knapsack Problem
This is an incremental improvement for combinatorial optimization researchers and practitioners.
The authors tackled the multidimensional knapsack problem by proposing a revised weight-coded evolutionary algorithm (RWCEA) with a new decoding method and heuristic initialization, which outperformed a prior algorithm and some benchmarks from the OR-library.
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm proposed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.